Fast mu-calculus model checking when tree-width is bounded

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

Volumn 2725, Issue , 2003, Pages 80-92

  Obdržálek, Jan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER AIDED ANALYSIS; COMPUTER PROGRAMMING LANGUAGES; FLOW GRAPHS; HIGH LEVEL LANGUAGES; POLYNOMIAL APPROXIMATION; TEMPORAL LOGIC; TREES (MATHEMATICS); VERIFICATION;

BOUNDED TREEWIDTH; CONTROL FLOW GRAPHS; MODEL CHECKING PROBLEM; MU-CALCULUS; PARITY GAMES; POLYNOMIAL-TIME; SOFTWARE VERIFICATION; TREE-WIDTH;

MODEL CHECKING;

EID: 35248864903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_7     Document Type: Article

References (18)

1. Hans L. Bodlaender. Treewidth: Algorithmic techniques and results. In MFCS'97, volume 1295 of LNCS, pages 19-36, 1997.
2. B. Courcelle. Graph rewriting: An algebraic and logic approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics, pages 193-242. Elsevier, Amsterdam, 1990.
3. E. Emerson and C. Jutla. Tree automata, mu-calculus and determinancy. In Proc. 5th IEE Foundations of Computer Science, pages 368-377, 1991.
4. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of mu-calculus. In CAV 93, volume 697 of LNCS, pages 385-396. Springer-Verlag, 1993.
5. E. A. Emerson and C. L. Lei. Efficient model checking in fragments of the prepositional μ-calculus. In Symposion on Logic in Computer Science, pages 267-278. IEEE Computer Society Press, June 1986.
6. M. Prick and M. Grobe. The complexity of first-order and monadic second-order logic revisited. In LICS'02, pages 215-224. IEEE Computer Society, 2002.
7. J. Gustedt, O. Mæhle, and J. A. Telle. The treewidth of Java programs. In Proceedings of ALENEX'02, volume 2409 of LNCS. Springer-Verlag, 2002.
8. M. Jurdziński. Small progress measures for solving parity games. In STACS 2000, volume 1770 of LNCS, pages 290-301. Springer-Verlag, 2000.
9. T. Kloks. Treewidth - computations and approximations, volume 842 of LNCS. Springer-Verlag, 1994.
10. D. Kozen. Results on the prepositional μ-calculus. Theoretical Computer Science (TCS), 27:333-354, 1983.
11. D. E. Long, A. Browne, E. M. Clarke, S. Jha, and W. R. Marrero. An improved algorithm for the evaluation of fixpoint expressions. In CAV '94, volume 818 of LNCS, pages 338-350. Springer-Verlag, 1994.
12. A. Mader. Verification of Modal Properties Using Boolean Equation Systems. Edition versai 8, Bertz Verlag, Berlin, 1997.
13. J. Obdržálek. Fast mu-calculus model checking when tree-width is bounded. Technical report, LFCS, July 2003. http://www.dcs.ed.ac.uk/home/s0128832.
14. N. Robertson and P. D. Seymour. Graph Minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B, 36:49-63, 1984.
15. C. Stirling. Local model checking games. In CONCUR '95, volume 962 of LNCS, pages 1-11. Springer-Verlag, 1995.
16. Colin Stirling. Modal and Temporal Properties of Processes. Texts in Computer Science. Springer-Verlag, 2001.
17. M. Thorup. All structured programs have small tree-width and good register allocation. Information and Computation, 142(2):159-181, 1998.
18. J. Vöge and M. Jurdzinski. A discrete strategy improvement algorithm for solving parity games. In CA V 2000, volume 1855 of LNCS, pages 202-215. Springer-Verlag, 2000.