Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Classical automata theory suffices for specifying and verifying concurrent digital systems, contrary to early process algebra critiques, via re-examination of 1950s-1960s methods.
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.
citing papers explorer
-
On the enumeration of Tarski fixed points
Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.
-
Standard Automata Theory and Process Algebra
Classical automata theory suffices for specifying and verifying concurrent digital systems, contrary to early process algebra critiques, via re-examination of 1950s-1960s methods.
-
Open Problems in a Logic of Gossips
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.