Symbolic model checking for μ-calculus requires exponential time

Theoretical Computer Science

Volumn 243, Issue 1-2, 2000, Pages 467-475

  Rabinovich, A ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Complexity; Model checking; calculus

Indexed keywords

EID: 0010399514     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00033-5     Document Type: Article

References (14)

1. J. Burch, E. Clarke, K. McMillan, D. Dill, L. Hwang, Symbolic model checking: 1020 states and beyond, Inform. Comput. 98 (2) (1002) 142-170.
2. A. Chandra, D. Kozen, L. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981) 114-131.
3. E. Clarke, E. Emerson, Design and synthesis of synchronizations skeleton using branching time temporal logic, in: Proc. Workshop on Logic of Programs, Lecture Notes in Computer Science, Vol. 131, 1981.
4. E. Emerson, Temporal, modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 997-1072.
5. E. Emerson, C. Lei, Efficient model checking in fragment of the propositional mu-calculus, in: Proceedings of the 1st Ann. Symp. on Logic in Computer Science, 1986.
6. J. Feigenbaum, S. Kannan, M. Vardi, M. Viswanathan, Complexity of problems on graphs represented as OBDDs, Proc. 15th STACS, Lecture Notes in Computer Science, Vol. 1373, Springer, Berlin, 1998, pp. 216-226.
7. M. Fisher, R. Lander, Propositional dynamic logic of regular programs, J. Comp. System Sci. 18 (1979) 194-211.
8. H. Galperin, A. Wigderson, Succinct representation of graphs, Inform. Control 56 (1983) 183-198.
9. L. Khasin, Complexity bounds for the realizations of monotonic symmetrical functions by means of formulas in the basis {∧, ∨, ¬}, Sov. Phys. Dokl. 14 (1970) 1149-1151.
10. D. Kozen, Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 33-354.
11. O. Kupferman, M. Vardi, P. Wolper. Automata theoretical approach to branching time model checking, Manuscript, June 1998.
12. K. McMillan, Symbolic model checking, Ph.D. Thesis, CMU, 1992.
13. A. Rabinovich, Complexity of equivalence problems for concurrent systems of finite agents, Inform. Comput. 139 (1997) 111-129.
14. C. Stirling, Modal and temporal logics, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, Oxford University Press, Oxford, 1992, pp. 476-567.