Simulation relations for alternating Büchi automata

Theoretical Computer Science

Volumn 338, Issue 1-3, 2005, Pages 275-314

  Fritz, Carsten ^a   Wilke, Thomas ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Alternating automata; Automata simplification; B chi automata; B chi games; Quotienting; Simulation relations

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FORMAL LOGIC; GAME THEORY; THEOREM PROVING;

ALTERNATING AUTOMATA; AUTOMATA SIMPLIFICATION; BÜCHI AUTOMATA; BÜCHI GAMES; QUOTIENTING;

AUTOMATA THEORY;

EID: 18544366109     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.01.016     Document Type: Article

References (30)

1. R. Alur, Th.A. Henzinger, O. Kupferman, M.Y. Vardi, Alternating refinement relations, in: D. Sangiorgi, R. de Simone (Eds.), CONCUR '98: Concurrency Theory, 9th Internat. Conf., Nice, France, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 163-178.
2. H.R. Andersen Model checking and boolean graphs Theoret. Comput. Sci. 126 1 1994 3 30
3. D. Bustan, O. Grumberg, Simulation based minimization, in: D.A. McAllester (Ed.), Automated Deduction - CADE-17, 17th Internat. Conf. on Automated Deduction, Pittsburg, PA, USA, Lecture Notes in Computer Science, Vol. 1831, Springer, Berlin, 2000, pp. 255-270.
4. M. Daniele, F. Giunchiglia, M.Y. Vardi, Improved automata generation for linear time temporal logic, in: N. Halbwachs, D. Peled (Eds.), Computer Aided Verificationt, 11th Internat. Conf., (CAV '99), Trento, Italy, Lecture Notes in Computer Science, Vol. 1633, Springer, Berlin, 1999, pp. 249-260.
5. D.L. Dill, A.J. Hu, H. Wong-Toi, Checking for language inclusion using simulation preorders, in: K. Guldstrand Larsen, A. Skou (Eds.), Computer Aided Verification, 3rd Internat. Workshop, CAV '91, Aalborg, Denmark, Lecture Notes in Computer Science, Vol. 575, Springer, Berlin, 1991, pp. 255-265.
6. E.A. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy (extended abstract), in: Proc. 32nd Ann. Symp. on Foundations of Computer Science (FoCS '91), IEEE Computer Society Press, Silver Spring, MD, 1991, pp. 368-377.
7. K. Etessami, A hierarchy of polynomial-time computable simulations for automata, in: L. Brim, P. Janar, M. Ketínský, A. Kuera (Eds.), CONCUR 2002 - Concurrency Theory: 13th Internat. Conf., Brno, Czech Republic, Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 131-144.
8. K. Etessami, G. Holzmann, Optimizing Büchi automata, in: C. Palamidessi (Ed.), CONCUR 2000 - Concurrency Theory: 11th Internat. Conf., University Park, PA, USA, Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, 2000, pp. 153-167.
9. K. Etessami, R. Schuller, Th. Wilke, Fair simulation relations, parity games, and state space reduction for Büchi automata, in: F. Orejas, P.G. Spirakis, J. van Leeuwen (Eds.), Automata, Languages and Programming, 28th Internat. Coll., ICALP 2001, Crete, Greece, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 694-707.
10. C. Fritz, Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata, in: O.H. Ibarra, Z. Dang (Eds.), Implementation and Application of Automata, Eighth Internat. Conf. CIAA 2003, Santa Barbara, CA, USA, Lecture Notes in Computer Science, Vol. 2759, Springer Berlin, 2003, pp. 35-48.
11. C. Fritz, B. Teegen, LTL → NBA, Link at http://www.ti.informatik. uni-kiel.de/~fritz/.
12. C. Fritz, Th. Wilke, State space reductions for alternating Büchi automata: quotienting by simulation equivalences, in: M. Agrawal, A. Seth (Eds.), 22nd Conf. on Foundations of Software Technology and Theoretical Computer Science, Kanpur, India, Lecture Notes in Computer Science, Vol. 2556, Springer, Berlin, 2002, pp. 157-168.
13. P. Gastin, D. Oddoux, Fast LTL to Büchi automata translation, in: G. Berry, H. Comon, A. Finkel (Eds.), Computer Aided Verification, 13th Internat. Conf., CAV 2001, Paris, France, 2001, Lecture Notes in Computer Science, Vol. 2102, Springer, Berlin, 2001, pp. 53-65.
14. R. Gerth, D. Peled, M.Y. Vardi, P. Wolper, Simple on-the-fly automatic verification of linear temporal logic, in: Proc. 15th Workshop on Protocol Specification, Testing, and Verification, Warsaw, Poland, June 1995, Chapman & Hall, London, 1995, pp. 3-18.
15. Y. Gurevich, L. Harrington, Trees, automata, and games, in: 14th ACM Symp. on the Theory of Computing, San Francisco, 1982, ACM Press, New York, pp. 60-65.
16. S. Gurumurthy, R. Bloem, F. Somenzi, Fair simulation minimization, in: E. Brinksma, K. Guldstrand Larsen (Eds.), Computer Aided Verification, 14th Internat. Conf., CAV 2002, Copenhagen, Denmark, Lecture Notes in Computer Science, Vol. 2404, Springer, Berlin, 2002, pp. 610-623.
17. Th.A. Henzinger, O. Kupferman, S.K. Rajamani, Fair simulation, in: CONCUR '97: Concurrency Theory, 8th Internat. Conf., Warsaw, Poland, Lecture Notes in Computer Science, Vol. 1243, Springer, Berlin, 1997, pp. 273-287.
18. Th.A. Henzinger, S.K. Rajamani, Fair bisimulation, in: S. Graf, M. Schwartzbach (Eds.), Tools and Algorithms for Construction and Analysis of Systems, 6th Internat. Conf., TACAS 2000, Lecture Notes in Computer Science, Vol. 1785, Springer, Berlin, 2000, pp. 299-314.
19. M. Henzinger Rauch, Th.A. Henzinger, P.W. Kopke, Computing simulations on finite and infinite graphs, in: 36th Ann. Symp. on Foundations of Computer Science (FOCS '95), 1995, pp. 453-462.
20. M. Jurdziński, Small progress measures for solving parity games, in: H. Reichel, S. Tison (Eds.), STACS 2000, 17th Ann. Symp. on Theoretical Aspects of Computer Science, Lille, France, Lecture Notes in Computer Science, Vol. 1770, February 2000, Springer, Berlin, 2000, pp. 290-301.
21. D.E. Knuth, Fundamental algorithms, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1968 (second ed., 1973).
22. O. Kupferman, M.Y. Vardi, and P. Wolper An automata-theoretic approach to branching-time model checking J. ACM 47 2 2000 312 360
23. R. Milner, An algebraic definition of simulation between programs, in: D.C. Cooper (Ed.), Proc. 2nd Internat. Joint Conf. on Artificial Intelligence, pp. 481-489, London, UK, September 1971, William Kaufmann.
24. R. Milner Communication and Concurrency 1989 Prentice-Hall Englewood Cliffs, NJ
25. S. Miyano, and T. Hayashi Alternating finite automata on ω -words Theoret. Comput. Sci. 32 1984 321 330
26. A.W. Mostowski, Games with forbidden positions, Tech. Report 78, Instytut Matematyki, Uniwersytet Gdański, Poland, 1991.
27. D.E. Muller, A. Saoudi, P.E. Schupp, Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time, in: 3rd IEEE Ann. Symp. on Logic in Computer Science, Edinburgh, Scotland, UK, 1988, pp. 422-427.
28. F. Somenzi, R. Bloem, Efficient Büchi automata from LTL formulae, in: E.A. Emerson, A. Prasad Sistla (Eds.), Computer Aided Verification, 12th Internat. Conf., CAV 2000, Chicago, IL, USA, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, July 2000, pp. 248-263.
29. R.E. Tarjan Depth first search and linear graphs SIAM J. Comput. 1 2 1972 146 160
30. M.Y. Vardi, Nontraditional applications of automata theory, in: M. Hagiya, J.C. Mitchell (Eds.), Theoretical Aspects of Computer Software, Internat. Conf. TACS '94, Sendai, Japan, Lecture Notes in Computer Science, Vol. 789, Springer, Berlin, 1994, pp. 575-597.