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.
Henzinger, Thomas A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
MoAT reduces LTL model checking of infinite state systems to fair termination via automata-based approach and calls KoAT/LoAT, matching state-of-the-art performance in experiments.
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.