Don't know in the μ-calculus

Lecture Notes in Computer Science

Volumn 3385, Issue , 2005, Pages 233-249

  Grumberg, Orna ^a   Lange, Martin ^b   Leucker, Martin ^c   Shoham, Sharon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF MUNICH   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; MATHEMATICAL MODELS;

ABSTRACT MODEL; CALCULUS; FINITE CONCRETE MODEL; GAME BASED MODEL;

GAME THEORY;

EID: 24144477925     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30579-8_16     Document Type: Conference Paper

References (23)

1. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
2. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Computer Aided Verification (CAV), LNCS 1855, 2000.
3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT press, Dec. 1999.
4. E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine leraning techniques. In CAV, 2002.
5. R. Cleaveland. Tableau-based model checking in the propositional mu-calculus. Acta Inf., 27:725-747, 1990.
6. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2), March 1997.
7. E. A. Emerson, and C. S. Jutla Tree automata, μ-calculus and determinacy. In Proc. 32th Symp. on Foundations of Computer Science (FOCS'91), pp. 368-377, 1991, IEEE Computer Society Press.
8. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Logic in Computer Science (LICS), 1986.
9. P. Godefroid and R. Jagadeesan. Automatic abstraction using generalized model checking. In Computer-Aided Verification (CAV), LNCS 2404, pp. 137-150, 2002.
10. P. Godefroid and R. Jagadeesan. On the expressiveness of 3-valued models. In VMCAI, LNCS 2575, pp. 206-222, 2003.
11. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: A foundation for three-valued program analysis. In European Symposium on Programming (ESOP), LNCS 2028, pp. 155-169, 2001.
12. D. Kozen. Results on the Propositional μ-calculus. TCS, 27: 333-354, 1983.
13. W. Lee, A. Pardo, J.-Y. Jang, G. D. Hachtel, and F. Somenzi. Tearing based automatic abstraction for CTL model checking. In ICCAD, pp. 76-81, 1996.
14. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:11-45, 1995.
15. D. Long, A. Browne, E. Clark, S. Jha, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. In CAV, LNCS 818, pp. 338-350, 1994.
16. A. Pardo and G. D. Hachtel. Automatic abstraction techniques for propositional mu-calculus model checking. In Computer Aided Verification (CAV), 1997.
17. A. Pardo and G. D. Hachtel. Incremental CTL model checking using BDD sub-setting. In Design Automation Conference (DAC), pp. 457-462, 1998.
18. S. Shoham and O. Grumberg. A game-based framework for CTL counterexamples and 3-valued abstraction-refinemnet. In Computer Aided Verification (CAV), LNCS 2725, pp. 275-287, 2003.
19. C. Stirling. Local model checking games. In Concurrency Theory (CONCUR), LNCS 962, pp. 1-11, 1995.
20. C. Stirling and D. J. Walker. Local model checking in the modal mu-calculus. In Theory and Practice of Software Development, LNCS, 1989.
21. A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific J.Math., 5:285-309, 1955.
22. G. Winskel. Model checking in the modal ν-calculus. In International Colloquium on Automata, Languages, and Programming (ICALP), 1989.
23. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200(1-2):135-183, 1998.