Model checking games for the alternation-free μ-calculus and alternating automata

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

Volumn 1705 LNAI, Issue , 1999, Pages 77-91

  Leucker, Martin ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; CLUSTERING ALGORITHMS; COMPUTER CIRCUITS; GAME THEORY; TEMPORAL LOGIC;

ALTERNATING AUTOMATA; AUTOMATA-BASED MODEL; GAME-BASED; GAME-BASED MODEL CHECKING; LINEAR-TIME ALGORITHMS; MU-CALCULUS; WINNING STRATEGY;

MODEL CHECKING;

EID: 84886292190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_6     Document Type: Conference Paper

References (18)

1. J.A. Brzozowski and E. Leiss. On equations for regular Isinguages, finite automata, and sequentizJ networks. Theoret. Comp. Set., 10:19-35, 1980.
2. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D.L. Dill, editor. Proceedings of the 6th International Conference on Computer-Aided Verification (CAV'94), volume 818 of LNCS, pages 142-155. Springer-Verlag, 1994.
3. Ashok K. Chzindra, Dexter C. Kozen, and Leirry J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, January 1981.
4. R. Cleaveland and B. Steffen. A linear-time model-checking cJgorithm for the alternation-free modcd mu-calculus. In Kim G. Larsen and Arne Skou, editors, Proceedings of Computer Aided Verification (CAV '91), volume 575 of LNCS, pages 48-58, Berlin, Germany, July 1992. Springer.
5. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. Technical Report CMU-CS-96-178, Carnegie Mellon University (CMU), September 1996. URL: ftp://reports.adin.cs.cnm.edu/ usr/anon/1996/CMU-CS-96-178. ps.
6. M. Daniele, F. Giunchiglia, find M. Y. Vardi. Improved automata generation for linear tempored logic. In Proc. of 11th Inter. Conf. on Computer Aided Verification, CAV '99, 1999.
7. E. A. Emerson. TemporsJ Jind modal logic. In J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: FormEil Models and Semantics, chapter 14, pages 996-1072. Elsevier Science Publishers B.V.: Amsterdam, The Netherlands, New York, N.Y., 1990.
8. Dexter Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, December 1983.
9. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata- heoretic approach to branching-time model checking. Full version of CAV'94 paper, 1998, URL: http://www.cs.rice.edu/"vardi/papers/cav94rj.ps.gz.
10. M. Lange, M. Leucker, T. Noll, and S. Tobies. Truth - a verification platform for concurrent systems. In Tool Support for System Specification, Development, and Verification, Advances in Computing Science. Springer-Verlag Wien New York, 1999.
11. Perdita Stevens and CoUn Stirling. PracticsJ model-checking using geimes. In B. Steffen, editor, Proceedings of 4th International Conference on Tools and algorithms for the construction and analysis of systems (TACAS'98), volume 1384 of LNCS, pages 85-101, New York, NY, USA, 1998. Springer
12. Stirling, C. Modal zind temporal logics. In Handbook of Logic in Computer Science, volume 2, pages 477-563. Clarendon Press, Oxford, 1992.
13. C. Stirling. Local model checking games. In Insup Lee and Scott A. Smolka, editors. Proceedings of the 6th International Conference on Concurrency Theory (CONCUR'95), volume 962 of LNCS, pages 1-11, Berlin, GER, August 1995. Springer.
14. C. Stirling. Games for bisimulation and model checking, July 996. Notes for Mathfit Workshop on finite model theory, University of Wales, Sweinsea, URL: http://www.dcs.ed.ac.uk/home/cps/mf i t. p s .
15. C. Stirhng. Games for bisimulation cind model checking, June 1997. Notes for Mathfit instructioncd meeting on games and computation, Edinburgh, URL: http://www.dcs.ed.ac.uk/home/cps/mathf i t. p s .
16. Wolfgang Thomcis. Automata on infinite objects. In J. van Leeuwen, editor. Handbook of Theoretical Computer Science, chapter 4, pages 133-191. Elsevier Science Publishers B. V., 1990.
17. Moshe Y. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic, volume 1043 of LNCS, pages 238-266. Springer, 1996.
18. M. Y. and P. Wolper. An automata-theoretic approjich to automatic program verification. In Symposium on Logic in Computer Science (LICS '86), pages 332-345, Washington, D.C., USA, June 1986. IEEE Computer Society Press.