Fair simulation relations, parity games, and state space reduction for Büchi automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 694-707

  Etessami, Kousha ^a   Wilke, Thomas ^b   Schuller, Rebecca A ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF KIEL   (Germany)

^c Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GAME THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION LANGUAGES; FAULT TOLERANCE;

BISIMULATION RELATIONS; DIRECT SIMULATION; FAIR SIMULATION; FAIR SIMULATION RELATIONS; SIMULATION RELATION; SPACE ALGORITHMS; STATE REDUCTION; STATE-SPACE REDUCTION; BISIMULATIONS;

COMPUTER SIMULATION LANGUAGES; ALGORITHMS;

EID: 84879534932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_57     Document Type: Conference Paper

References (16)

1. H. Andersen. Model checking and boolean graphs. TCS, 126(1):3-30, 1994.
2. D. Bustan and O. Grumberg. Checking for fair simulation in models with Büchi fairness constraints, Dec. 2000. Tech. Rep. TR-CS-2000-13, Technion.
3. B. Bloom and R. Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24(3):189-220, 1995.
4. D. L. Dill, A. J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In Proceedings of CAV'91, pages 329-341, 1991.
5. K. Etessami and G. Holzmann. Optimizing Büchi automata. In Proc. of 11th Int. Conf on Concurrency Theory (CONCUR), pages 153-167, 2000.
6. O. Grumberg and D. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
7. M. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In Proc. of 36th IEEE Symp. on Foundations of Comp. Sci. (FOCS'95), pages 453-462, 1995.
8. T. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proc. of 9th Int. Conf. on Concurrency Theory (CONCUR'97), number 1243 in LNCS, pages 273-287, 1997.
9. T. Henzinger and S. Rajamani. Fair bisimulation. In TACAS, 2000.
10. M. Jurdziński. Small progress measures for solving parity games. In STACS 2000, 17th Symp. on Theoretical Aspects of Computer Science, volume 1770 of LNCS, pages 290-301. Springer-Verlag, 2000.
11. N. Klarlund. Progress measures,immediate determinacy, & a subset construction for tree automata. Ann. Pure & Applied Logic, 69:243-268, 1994.
12. Kupferman and M. Y. Vardi. Weak alternating automata are not that weak. In Proc. 30th ACM Symp. on Theory of Computing, 1998.
13. R. Milner. Communicatation and Concurrency. Prentice-Hall, 1989.
14. R. Paige and R. E. Tarjan. Three partition-refinement algorithms. SIAM J. of Computing, 16(6):973-989, 1987.
15. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Proceedings of 12th Int. Conf. on Computer Aided Verification, 2000.
16. Walukiewicz. Pushdown processes: games and model checking. In Computer Aided Verification, LNCS, pages 62-75. springer-verlag, 1996.