Infinite games and verification (extended abstract of a tutorial)

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

Volumn 2404, Issue , 2002, Pages 58-65

  Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHMIC THEORY; AUTOMATIC PROGRAMS; EXTENDED ABSTRACTS; INFINITE GAME;

COMPUTER AIDED ANALYSIS;

EID: 84937560933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_5     Document Type: Conference Paper

References (14)

1. E. Asarin, O. Maler, A. Pnueli, J. Sifakis, Controller Synthesis for Timed Automata, Proc. IFAC Symposium on System Structure and Control, 469-474, Elsevier, Amsterdam 1998.
2. E. Asarin, O. Maler, As Soon as Possible: Time Optimal Control for Timed Automata, Hybrid Systems (F. Vaandrager et al. Eds.): Computation and Control, Lecture Notes in Computer Science 1569 (1999), 19-30.
3. E. A. Emerson, C. S. Jutla, A. P. Sistla, On model checking for fragments of μ-calculus, in: CAV’93 (C. Coucoubetis, Ed), Lecture Notes in Computer Science 697 (1993), 385-396.
4. S. Dziembowski, M. Jurdzinski, I. Walukiewicz, How much memory is needed to win infinite games?, Proc. 12th IEEE Symp. on Logic in Computer Science, 1997, 99-110.
5. M. Jurdzinski, Deciding the winner in parity games is in UP∩co-UP, Inform. Processing Letters 68 (1998), 119-124.
6. O. Kupferman, M. Y. Vardi, Church’s problem revisited, Bull. Symb. Logic 5 (1999), 245-263.
7. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs, Springer-Verlag, Berlin-Heidelberg-New York 1992.
8. P. Madhusudan, P. S. Thiagarajan: Distributed Controller Synthesis for Local Specifications. Proc. ICALP 2001, Lecture Notes in Computer Science 2076 (2001), 396-407.
9. A. Pnueli, R. Rosner, Distributed reactive systems are hard to synthesize, Proc. 31st IEEE Symp. on Foundation of Computer Science, 1990, 746-757.
10. C. Stirling, Modal and Temporal Properties of Processes, Springer-Verlag, New York 2001.
11. W. Thomas, On the synthesis of strategies in infinite games, in: STACS’95 (E. W. Mayr, C. Puech, Eds.), Lecture Notes in Computer Science 900 (1995), 1-13.
12. W. Thomas, Languages, automata, and logic, in: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, Eds.), Vol. 3, Springer-Verlag, Berlin Heidelberg 1997.
13. J. Vöge, M. Jurdzinski, A strategy improvement algorithm for solving parity games, CAV 2000, Lect. Notes in Computer Science 1855 (2000), 202-215.
14. I. Walukiewicz, Pushdown processes: games and model-checking, Information and Computation 157 (2000), 234-263.