State space reductions for alternating Büchi automata quotienting by simulation equivalences

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

Volumn 2556 LNCS, Issue , 2002, Pages 157-168

  Fritz, Carsten ^a   Wilke, Thomas ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

MINIMAX; QUOTIENTING; STATE-SPACE REDUCTION; WELL-ESTABLISHED TECHNIQUES;

AUTOMATA THEORY;

EID: 84877785292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_15     Document Type: Conference Paper

References (29)

1. Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, and Moshe Y. Vardi. Alternating refinement relations. In D. Sangiorgi and R. de Simone, editors, CONCUR 1998, vol. 1466 of LNCS, pp. 163-178, 1998.
2. Doran Bustan and Orna Grumberg. Checking for fair simulation in models with Büchi fairness constraints, Dec. 2000. Tech. Rep. TR-CS-2000-13, Technion.
3. Marco Daniele, Fausto Giunchiglia, and MosheY. Vardi. Improved automata generation for linear time temporal logic. In N. Halbwachs and D. Peled, editors, CAV 1999, vol. 1633 of LNCS, pp. 249-260, 1999.
4. David L. Dill, Alan J. Hu, and Howard Wong-Toi. Checking for language inclusion using simulation preorders. In Kim G. Larsen and Arne Skou, editors, CAV 1991, vol. 575 of LNCS, pp. 255-265, 1991.
5. Kousha Etessami and Gerard Holzmann. Optimizing Büchi automata. In Catuscia Palamidessi, editor, CONCUR 2000, vol. 1877 of LNCS, pp. 153-167, 2000.
6. E. Allen Emerson and Charanjit S. Jutla. The complexity of tree automata and logics of programs (extended abstract). In FoCS 1988, pp. 328-337. 1988. IEEE.
7. E. Allen Emerson and CharanjitS. Jutla. Tree automata, mu-calculus and determinacy. In FoCS 1991, pp. 368-377, San Juan, Puerto Rico, Oct. 1991. IEEE.
8. Kousha Etessami, Rebecca Schuller, and Thomas Wilke. Fair simulation relations, parity games, and state space reduction for Büchi automata. In F. Orejas, P.G. Spirakis, and J. van Leeuwen, editors, ICALP 2001, vol. 2076 of LNCS, pp. 694-707, 2001.
9. Kousha Etessami. A Hierarchy of Polynomial-Time Computable Simulations for Automata. CONCUR 2002, to appear.
10. Carsten Fritz and Thomas Wilke. Simulation relations for alternating Büchi automata. Extended version of tech. rep. 2019, Institut für Informatik, CAU Kiel, July2002. URL:http://www.informatik.uni-kiel.de/~fritz/ TechRep2019ext.ps.
11. Yuri Gurevich and Leo Harrington. Trees, automata, and games. In 14th ACM Symp. on the Theory of Computing, pp. 60-65, 1982.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979.
13. Paul Gastin and Denis Oddoux. Fast LTL to Büchi automata translation. In G. Berry, H. Comon, and A. Finkel, editors, CAV 2001, vol. 2102 of LNCS, pp. 53-65, 2001.
14. Rob Gerth, Doron Peled, Moshe Y. Vardi, and Pierre Wolper. Simple on-the-fly automatic verification of linear temporal logic. In PSTV 1995, pp. 3-18, Warsaw, Poland, June 1995. Chapman Hall.
15. Sankar Gurumurthy, Roderick Bloem, and Fabio Somenzi. Fair simulation minimization. CAV 2002, to appear.
16. Monika Henzinger Rauch, Thomas A. Henzinger, and Peter W. Kopke. Computing simulations on finite and infinite graphs. In FoCS 1995, pp. 453-462, 1995.
17. Thomas A. Henzinger, Orna Kupferman, and Sriram K. Rajamani. Fair simulation. In CONCUR 1997, vol. 1243 of LNCS, pp. 273-287, 1997.
18. Thomas A. Henzinger and Sriram K. Rajamani. Fair bisimulation. In S. Graf and M. Schwartzbach, editors, TACAS 2000, vol. 1785 of LNCS, pp. 299-314, 2000.
19. Marcin Jurdziński. Small progress measures for solving parity games. In H. Reichel and S. Tison, editors, STACS 2000, vol. 1770 of LNCS, pp. 290-301, 2000.
20. Orna Kupferman, Moshe Y. Vardi, and Pierre Wolper. Anautomata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, 2000.
21. Martin Leucker and Thomas Noll. Truth/SLC - A parallel verification platform for concurrent systems. In G. Berry, H. Comon, and A. Finkel, editors, CAV 2001, vol. 2102 of LNCS, pp. 255-259, 2001.
22. Kenneth L. McMillan. Symbolic Model Checking. Kluwer, Boston, 1993.
23. S. Miyano and T. Hayashi. Alternating finite automata on ω-words. Theoretical Computer Science, 32:321-330, 1984.
24. Robin Milner. An algebraic definition of simulation between programs. In D. C. Cooper, editor, Proc. of the 2nd Int. Joint Conf. on Artificial Intelligence, pp. 481-489, London, UK, September 1971.
25. William Kaufmann. David E. Muller, Ahmed Saoudi, and Paul E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In LICS 1988, pp. 422-427, IEEE Computer Society, 1988.
26. Fabio Somenzi and Roderick Bloem. Efficient Büchi automata from LTL formulae. In E. Allen Emerson and A. Prasad Sistla, editors, CAV 2000, vol. 1855 of LNCS, pp. 248-263, 2000.
27. Moshe Y. Vardi. Nontraditional applications of automata theory. In Theoretical Aspects of Computer Software, vol. 789 of LNCS, pp. 575-597, 1994.
28. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification. In Dexter Kozen, editor, LICS 1986, pp. 332-344, Cambridge, Mass., 16-18 June 1986.
29. Moshe Y. Vardi and Pierre Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.