A parametric analysis of the state explosion problem in model checking

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

Volumn 2285, Issue , 2002, Pages 620-631

  Demri, S ^a   Laroussinie, F ^a   Schnoebelen, P ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPLEXITY MEASURES; ELEMENTARY SUBSYSTEMS; MODEL CHECKING PROBLEM; PARAMETERIZED; PARAMETERIZED COMPLEXITY; PARAMETRIC -ANALYSIS; STATE EXPLOSION PROBLEMS; SYNCHRONIZED PRODUCT;

MODEL CHECKING;

EID: 84937411837     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45841-7_51     Document Type: Article

References (27)

1. K. A. Abrahamson, R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Annals of Pure and Applied Logic, 73(3):235-276, 1995.
2. H. R. Andersen. Verification of Temporal Properties of Concurrent Systems. PhD thesis, Aarhus University, Denmark, June 1993.
3. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham. The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science, 147(1-2):31-54, 1995.
4. J. Bradfield and C. Stirling. Modal logics and mu-calculi: an introduction. In Handbook of Process Algebra, ch 4, pp 293-330. Elsevier Science, 2001.
5. Liming Cai, Jianer Chen, R. G. Downey, and M. R. Fellows. On the parameterized complexity of short computation and factorization. Archive for Mathematical Logic, 36(4/5):321-337, 1997.
6. M. Cesati. The Turing way to the parameterized intractability, September 2001. Submitted.
7. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
8. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
9. S. Demri, F. Laroussinie, and Ph. Schnoebelen. A parametric analysis of the state explosion problem in model checking. Research Report LSV-01-4, Lab. Specification and Verification, ENS de Cachan, France, Apr. 2001.
10. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, vol. B, ch 16, pp 995-1072. Elsevier Science, 1990.
11. J. Esparza. Decidability and complexity of Petri net problems — an introduction. In Advances in Petri Nets 1998, LNCS 1491, pp 374-428. Springer, 1998.
12. R. J. van Glabbeek. The linear time - branching time spectrum I. In Handbook of Process Algebra, ch 1, pp 3-99. Elsevier Science, 2001.
13. M. Grohe. Descriptive and parameterized complexity. In Computer Science Logic (CSL’99), LNCS 1683, pp 14-31. Springer, 1999.
14. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In 33rd ACM Symp. Theory of Computing (STOC’01), pp 657-666, 2001.
15. D. Harel, O. Kupferman, and M. Y. Vardi. On the complexity of verifying concurrent transition systems. In Concurrency Theory (CONCUR’97), LNCS 1243, pp 258-272. Springer, 1997.
16. L. Jategaonkar and A. R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science, 154(1):107-143, 1996.
17. T. Kasai, A. Adachi, and S. Iwata. Classes of pebble games and complete problems. SIAM J. Comput., 8(4):574-586, 1979.
18. P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes and three problems of equivalence. Information and Computation, 86(1):43-68, 1990.
19. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. J. ACM, 47(2):312-360, 2000.
20. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In 12th ACM Symp. Principles of Programming Languages (POPL’85), pp 97-107, 1985.
21. F. Laroussinie and Ph. Schnoebelen. The state explosion problem from trace to bisimulation equivalence. In Found. Software Science & Computation Structures (FOSSACS’2000), LNCS 1784, pp 192-207. Springer, 2000.
22. C. H. Papadimitriou and M. Yannakakis. On the complexity of database queries. J. Computer and System Sciences, 58(3):407-427, 1999.
23. A. Rabinovich. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation, 139(2):111-129, 1997.
24. A. Rabinovich. Symbolic model checking for µ-calculus requires exponential time. Theoretical Computer Science, 243(1-2):467-475, 2000.
25. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. J. ACM, 32(3):733-749, 1985.
26. Z. Sawa and P. Jančar. P-hardness of equivalence testing on finite-state processes. In Current Trends in Theory and Practice of Informatics (SOF-SEM’01), LNCS 2234, pp 326-335. Springer, 2001.
27. H. T. Wareham. The parameterized complexity of intersection and composition operations on sets of finite-state automata. In Implementation & Application of Automata (CIAA’2000), LNCS 2088, pp 302-310. Springer, 2001.