Solving games without determinization

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

Volumn 4207 LNCS, Issue , 2006, Pages 395-410

  Henzinger, Thomas A ^a   Piterman, Nir ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CODES (SYMBOLS); GRAPH THEORY;

DETERMINISTIC AUTOMATON; REACTIVE SYSTEMS; SYMBOLIC IMPLEMENTATION;

GAME THEORY;

EID: 33750340540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_26     Document Type: Conference Paper

References (24)

1. [ATW05] C.S. Althoff, W. Thomas, and N. Wallmeier. Observations on determinization of büchi automata. In CIAA, LNCS. Springer, 2005.
2. [BL69] J.R. Büchi and L.H.G. Landweber. Solving sequential conditions by finite-state strategies. Trans. AMS, 138:295-311, 1969.
3. [EJ91] E.A. Emerson and C. Jutla. Tree automata, μ-calculus mid determinacy. In FOCS, pp. 368-377, IEEE, 1991.
4. [EJS93] E.A. Emerson, C. Jutla, and A.P. Sistla. On model checking for fragments of μ-calculus. In CAV, LNCS 697, pp. 385-396, Springer, 1993.
5. [HKR97] T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In CONCUR, LNCS 1243, pp. 273-287, Springer, 1997.
6. [HRS05] A. Harding. M. Ryatt, and P.Y. Schobbens. A new algorithm for strategy synthesis in LTL games. In TACAS, LNCS 3440, pp. 477-492, 2005.
7. [JGB05] B. Jobstmann, A. Griesmayer, and R. Bloem. Program repair as a game. In CAV, LNCS 3576, pp. 226-238, Springer, 2005.
8. [Jur00] M. Jurdzinski. Small progress measures for solving parity games. In STACS, LNCS 1770. pp. 290-301. Springer, 2000.
9. [JV00] M. Jurdzinski J. Voge. A discrete strategy improvement algorithm for solving parity games. In CAV, LNCS 1855, pp. 202-215, Springer, 2000.
10. [KB05] J. Klein and C. Baior. Experiments with deterministic ω-automata for formulas of linear temporal logic. In CIAA, LNCS. Springer. 2005.
11. [KPP05] Y. Kesten. N. Piterman. and A. Pnueli. Bridging the gap between fair simulation and trace containment. I&C, 200:35-61. 2005.
12. [KV05] O. Kupferman and M.Y. Vardi. Safraless decision procedures. In FOCS, IEEE. 2005.
13. [Lan69] L.H. Landweber. Decision problems for ω automata. MST. 3:376-384, 1969.
14. [Löd98] C. Löding. Methods for the transformation of ω-automata: Complexity and connection to second-order logic. Master Thesis, University of Kiel, 1998.
15. [Mar75] D.A. Martin. Borel Determinacy. Annals of Mathematics, 65:363-371, 1975.
16. [McM93] K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
17. [MH84] S. Miyano and T. Hayashi. Alternating finite automata on ω-words, Theoretical Computer Science, 32:321-330, 1984.
18. [Mic88] M. Michel. Complementation is more difficult with automata on infinite words. CNET. Paris. 1988.
19. [Pit06] N. Piterman. From nondeterministic Büchi and Streett automata to deterministic parity automata. In LICS, IEEE, 2006. To appear.
20. [RA03] P. Madhusudan R. Alur, and S. La Torre. Playing games with boxes and diamonds. In CONCUR, LNCS 2761, pp. 127-141. Springer, 2003.
21. [Rab72] M.O. Rabin. Automata on infinite objects and Church's problem. American Mathematical. Society, 1972.
22. [RW89] P.J.G. Ramadge and W.M. Wonham. The control of discrete event systems. Trans. Control Theory. 77:81-98, 1989.
23. [Saf88] S. Safra. On the complexity of ω-automata. In FOCS, IEEE. 1988.
24. [THB95] S. Tasiran, R. Hojati, and R.K. Brayton. Language containment using non-deterministic ω-automata, In CHARME, LNCS 987, 1995.