Satisfiability and finite model property for the alternating-time μ-calculus

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

Volumn 4207 LNCS, Issue , 2006, Pages 591-605

  Schewe, Sven ^a   Finkbeiner, Bernd ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; CONCURRENT ENGINEERING; GAME THEORY; PROBLEM SOLVING;

ALTERNATING-TIME FORMULAS; FINITE MODEL PROPERTY; SATISFIABILITY PROBLEM;

DECISION THEORY;

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

References (20)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):672-713, 2002.
2. R. Alur, T. A. Henzinger, F. Y. C. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha: Modularity in model checking. In Proc. CAV, pages 521-525. Springer-Verlag, June 1998.
3. J. R. Büchi. On a decision method in restricted second order arithmetic. Logic, Methodology and Philosophy of Science, pages 1-11, 1962.
4. L. de Alfaro, T. A. Henzinger, and R. Majumdar. From verification to control: Dynamic programs for omega-regular objectives. In Proc. LICS, pages 279-290. IEEE Computer Society Press, June 2001.
5. E. A. Emerson and C. S. Jutla. Tree automata, μ-calculus and determinacy. In Proc. FOCS, pages 368-377. IEEE Computer Society Press, October 1991.
6. S. Even and Y. Yacobi. Relations among public key signature systems. Technical Report 175, Technion, Haifa, Israel, March 1980.
7. B. Finkbeiner and S. Schewe. Uniform distributed synthesis. In Proc. LICS, pages 321-330. IEEE Computer Society Press, June 2005.
8. M. Jurdziński. Small progress measures for solving parity games. In Proc. STACS, pages 290-301. Springer-Verlag, 2000.
9. D. Kozen and R. J. Parikh. A decision procedure for the prepositional μ-calculus. In Proc. Logic of Programs, pages 313-325. Springer-Verlag. 1983.
10. S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. Journal of Computer Security, 11(3):399-430, 2003.
11. O. Kupferman and M. Y. Vardi. μ-calculus synthesis. In Proc. MFCS, pages 497-507. Springer-Verlag. 2000.
12. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
13. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9(5):521-530, October 1966.
14. D. E. Muller and P. E. Schupp. Simulating alternating tree automata by non-deterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci., 141(1-2):69-107, 1995.
15. M. O. Rabin. Automata on Infinite Objects and Church's Problem, volume 13 of Regional Conference Series in Mathematics. Amer. Math. Soc., 1972.
16. S. Safra. On the complexity of the ω-automata. In Proc. FoCS, pages 319-327. IEEE Computer Society Press, 1988.
17. G. van Drimmelen. Satisfiability in alternating-time temporal logic. In Proc. LICS, pages 208-217. IEEE Computer Society Press, June 2003.
18. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Journal of Information and Computation, 115(1): 1-37, May 1994.
19. D. Walther, C. Lutz, F. Wolter, and M. Wooldridge. Atl satisfiability is indeed exptime-complete. Journal of Logic and Computation, 2006. To appear.
20. T. Wilke. Alternating tree automata, parity games, and modal μ-calculus. Bull. Soc. Math. Belg., 8(2), May 2001.