A parametric analysis of the state-explosion problem in model checking

Journal of Computer and System Sciences

Volumn 72, Issue 4, 2006, Pages 547-575

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

^a CNRS   (France)

Author keywords

Bisimilarity; Model checking; Parameterized complexity; State explosion problem; Temporal logics

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; ROBUSTNESS (CONTROL SYSTEMS);

BISIMILARITY; MODEL CHECKING; PARAMETERIZED COMPLEXITY; STATE-EXPLOSION PROBLEMS; TEMPORAL LOGICS;

PROBLEM SOLVING;

EID: 33748160134     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.11.003     Document Type: Article

References (55)

1. Arnold A., and Niwiński D. Rudiments of μ-Calculus. Stud. Logic Found. Math. vol. 146 (2001), Elsevier Science
2. Bérard B., Bidoit M., Finkel A., Laroussinie F., Petit A., Petrucci L., and Schnoebelen Ph. Systems and Software Verification. Model-Checking Techniques and Tools (2001), Springer-Verlag
3. Bodlaender H.L., Downey R.G., Fellows M.R., and Wareham H.T. The parameterized complexity of sequence alignment and consensus. Theoret. Comput. Sci. 147 1-2 (1995) 31-54
4. Bradfield J.C., and Stirling C. Modal logics and mu-calculi: An introduction. In: Bergstra J.A., Ponse A., and Smolka S.A. (Eds). Handbook of Process Algebra (2001), Elsevier Science 293-330 (Chapter 4)
5. Cadoli M., Donini F.M., Liberatore P., and Schaerf M. Preprocessing of intractable problems. Inform. and Comput. 176 2 (2002) 89-120
6. Cai L., Chen J., Downey R.G., and Fellows M.R. Advice classes of parameterized tractability. Ann. Pure Appl. Logic 84 1 (1997) 119-138
7. Cai L., Chen J., Downey R.G., and Fellows M.R. On the parameterized complexity of short computation and factorization. Arch. Math. Logic 36 4/5 (1997) 321-337
8. Cesati M. The Turing way to parameterized intractability. J. Comput. System Sci. 67 4 (2003) 654-685
9. Cesati M., and Di Ianni M. Computation models for parameterized complexity. Math. Log. Q. 43 (1997) 179-202
10. Chen Y., and Flum J. Machine characterization of the classes of the W-hierarchy. Proc. 17th Int. Workshop Computer Science Logic, CSL 2003, and 8th Kurt Gödel Coll., KGL 2003. Vienna, Austria, August, 2003. Lecture Notes in Comput. Sci. vol. 2803 (2003), Springer-Verlag 114-127
11. Chen Y., Flum J., and Grohe M. Bounded nondeterminism and alternation in parameterized complexity theory. Proc. 18th Annual IEEE Conference on Computational Complexity, Complexity 2003. Aarhus, Denmark, July, 2003 (2003), IEEE Comput. Soc. 13-29
12. Clarke E.M., and Emerson E.A. Design and synthesis of synchronization skeletons using branching time temporal logic. Proc. Logics of Programs Workshop. Yorktown Heights, New York, May, 1981. Lecture Notes in Comput. Sci. vol. 131 (1981), Springer-Verlag 52-71
13. Clarke E.M., Grumberg O., and Peled D.A. Model Checking (1999), MIT Press
14. Demri S., Laroussinie F., and Schnoebelen Ph. A parametric analysis of the state explosion problem in model checking. Extended abstract. Proc. 19th Ann. Symp. Theoretical Aspects of Computer Science, STACS 2002. Antibes Juan-les-Pins, France, March, 2002. Lecture Notes in Comput. Sci. vol. 2285 (2002), Springer-Verlag 620-631
15. Demri S., and Schnoebelen Ph. The complexity of propositional linear temporal logics in simple cases. Inform. and Comput. 174 1 (2002) 84-103
16. Downey R.G., Estivill-Castro V., Fellows M.R., Prieto E., and Rosamond F.A. Cutting up is hard to do: The parameterized complexity of k-cut and related problems. Proc. Computing: The Australasian Theory Symposium, CATS 2003. Adelaide, Australia, February, 2003. Electron. Notes Theoret. Comput. Sci. vol. 78 (2003), Elsevier Science
17. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag
18. Downey R.G., Fellows M.R., and Stege U. Computational tractability: The view from Mars. EATCS Bull. 69 (1999) 73-97
19. Downey R.G., Fellows M.R., and Stege U. Parameterized complexity: A framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 49 (1999), Amer. Math. Soc. 49-99
20. Emerson E.A. Temporal and modal logic. Chapter 16. In: Leeuwen J.v. (Ed). Handbook Theoret. Comput. Sci. vol. B (1990), Elsevier Science 995-1072
21. Emerson E.A., Jutla C.S., and Sistla A.P. On model-checking for the μ-calculus and its fragments. Theoret. Comput. Sci. 258 1-2 (2001) 491-522
22. Esparza J. Decidability and complexity of Petri net problems-An introduction. Advances in Petri Nets, 1998. Lecture Notes in Comput. Sci. vol. 1491 (1998), Springer-Verlag 374-428
23. Feigenbaum J., Kannan S., Vardi M.Y., and Viswanathan M. The complexity of problems on graphs represented as OBDDs. Chic. J. Theoret. Comput. Sci. (1999)
24. Flum J., and Grohe M. Fixed-parameter tractability, definability, and model checking. SIAM J. Comput. 31 1 (2001) 43-73
25. Flum J., and Grohe M. Describing parameterized complexity classes. Proc. 19th Ann. Symp. Theoretical Aspects of Computer Science, STACS 2002. Antibes Juan-les-Pins, France, March, 2002. Lecture Notes in Comput. Sci. vol. 2285 (2002), Springer-Verlag 359-371
26. Flum J., and Grohe M. Model-checking problems as a basis for parameterized intractability. Proc. 19th IEEE Symp. Logic in Computer Science, LICS 2004. Turku, Finland, July, 2004 (2004), IEEE Comput. Soc. 388-397
27. Gabbay D.M., Pnueli A., Shelah S., and Stavi J. On the temporal analysis of fairness. Proc. 7th ACM Symp. Principles of Programming Languages, POPL '80. Las Vegas, NV, USA, January, 1980 (1980), ACM Press 163-173
28. Galil Z. Hierarchies of complete problems. Acta Inform. 6 2 (1976) 77-88
29. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness (1979), Freeman
30. M. Grohe, T. Schwentick, L. Segoufin, When is the evaluation of conjunctive queries tractable? in: Proc. 33rd ACM Symp. Theory of Computing, STOC 2001, Heraklion, Crete, Greece, July, 2001, pp. 657-666
31. Harel D., Kupferman O., and Vardi M.Y. On the complexity of verifying concurrent transition systems. Inform. and Comput. 173 2 (2002) 143-161
32. Hennessy M., and Milner R. Algebraic laws for nondeterminism and concurrency. J. ACM 32 1 (1985) 137-161
33. Immerman N. Nondeterministic space is closed under complementation. SIAM J. Comput. 17 5 (1988) 935-938
34. Jategaonkar L., and Meyer A.R. Deciding true concurrency equivalences on safe, finite nets. Theoret. Comput. Sci. 154 1 (1996) 107-143
35. Jones N.D., Landweber L.H., and Lien Y.E. Complexity of some problems in Petri nets. Theoret. Comput. Sci. 4 3 (1977) 277-299
36. Kanellakis P.C., and Smolka S.A. CCS expressions, finite state processes and three problems of equivalence. Inform. and Comput. 86 1 (1990) 43-68
37. Kasai T., Adachi A., and Iwata S. Classes of pebble games and complete problems. SIAM J. Comput. 8 4 (1979) 574-586
38. Kozen D.C. Lower bounds for natural proof systems. Proc. 18th IEEE Symp. Foundations of Computer Science, FOCS '77. Providence, RI, USA, October-November, 1977 (1977), IEEE Comput. Soc. 254-266
39. Kupferman O., Vardi M.Y., and Wolper P. An automata-theoretic approach to branching-time model checking. J. ACM 47 2 (2000) 312-360
40. Lange K.-L., and Rossmanith P. The emptiness problem for intersections of regular languages. Proc. 17th Int. Symp. Math. Found. Comp. Sci., MFCS '92. Prague, Czechoslovakia, August, 1992. Lecture Notes in Comput. Sci. vol. 629 (1992), Springer-Verlag 346-354
41. Laroussinie F., and Schnoebelen Ph. The state explosion problem from trace to bisimulation equivalence. Proc. 3rd Int. Conf. Foundations of Software Science and Computation Structures, FOSSACS 2000. Berlin, Germany, March-April, 2000. Lecture Notes in Comput. Sci. vol. 1784 (2000), Springer-Verlag 192-207
42. O. Lichtenstein, A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, in: Proc. 12th ACM Symp. Principles of Programming Languages, POPL '85, New Orleans, LA, USA, January, 1985, pp. 97-107
43. Markey N., and Schnoebelen Ph. Model checking a path. Proc. 14th Int. Conf. Concurrency Theory, CONCUR 2003, Marseille, France, September, 2003. Lecture Notes in Comput. Sci. vol. 2761 (2003), Springer-Verlag 251-265
44. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
45. Papadimitriou C.H., and Yannakakis M. On the complexity of database queries. J. Comput. System Sci. 58 3 (1999) 407-427
46. Rabinovich A. Complexity of equivalence problems for concurrent systems of finite agents. Inform. and Comput. 139 2 (1997) 111-129
47. Rabinovich A. Symbolic model checking for μ-calculus requires exponential time. Theoret. Comput. Sci. 243 1-2 (2000) 467-475
48. Sawa Z. Equivalence checking of non-flat systems is EXPTIME-hard. Proc. 14th Int. Conf. Concurrency Theory, CONCUR 2003. Marseille, France, September, 2003. Lecture Notes in Comput. Sci. vol. 2761 (2003), Springer-Verlag 233-248
49. Z. Sawa, personal communication, April, 2005
50. Schnoebelen Ph. The complexity of temporal logic model checking. Advances in Modal Logic vol. 4 (2003), King's College Publication 437-459
51. Sistla A.P., and Clarke E.M. The complexity of propositional linear temporal logics. J. ACM 32 3 (1985) 733-749
52. Valmari A., and Kervinen A. Alphabet-based synchronisation is exponentially cheaper. Proc. 13th Int. Conf. Concurrency Theory, CONCUR 2002. Brno, Czech Republic, August, 2002. Lecture Notes in Comput. Sci. vol. 2421 (2002), Springer-Verlag 161-176
53. van Glabbeek R. The linear time-branching time spectrum I. Chapter 1. In: Bergstra J., Ponse A., and Smolka S. (Eds). Handbook of Process Algebra (2001), Elsevier Science 3-99
54. Wagner K.W. The complexity of combinatorial problems with succinct input representation. Acta Inform. 23 3 (1986) 325-356
55. Wareham H.T. The parameterized complexity of intersection and composition operations on sets of finite-state automata. Proc. 5th Int. Conf. Implementation and Application of Automata, CIAA 2000. London, ON, Canada, July, 2000. Lecture Notes in Comput. Sci. vol. 2088 (2001), Springer-Verlag 302-310