Weak Kripke Structures and LTL

  • Lars Kuhtz
  • Bernd Finkbeiner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6901)

Abstract

We revisit the complexity of the model checking problem for formulas of linear-time temporal logic (LTL). We show that the classic PSPACE-hardness result is actually limited to a subclass of the Kripke frames, which is characterized by a simple structural condition: the model checking problem is only PSPACE-hard if there exists a strongly connected component with two distinct cycles. If no such component exists, the problem is in coNP. If, additionally, the model checking problem can be decomposed into a polynomial number of finite path checking problems, for example if the frame is a tree or a directed graph with constant depth, or the frame has an SCC graph of constant depth, then the complexity reduces further to NC.

Keywords

Model Check Turing Machine Constant Depth Atomic Proposition Computation Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Artho, C., Barringer, H., Goldberg, A., Havelund, K., Khurshid, S., Lowry, M., Pasareanu, C., Rosu, G., Sen, K., Visser, W., Washington, R.: Combining test case generation and runtime verification. Theoretical Computer Science 336(2-3), 209–234 (2005)Google Scholar
  2. 2.
    Baker, T.P.: The cyclic executive model and ada. The Journal of Real-Time Systems 1, 120–129 (1989)CrossRefGoogle Scholar
  3. 3.
    Bauland, M., Mundhenk, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The tractability of model-checking for ltl: The good, the bad, and the ugly fragments. Electr. Notes Theor. Comput. Sci. 231, 277–292 (2009)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bauland, M., Schneider, T., Schnoor, H., Schnoor, I., Vollmer, H.: The complexity of generalized satisfiability for linear temporal logic. Logical Methods in Computer Science 5(1) (2009)Google Scholar
  5. 5.
    Benedikt, M., Libkin, L., Neven, F.: Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2) (2007)Google Scholar
  6. 6.
    Buss, S.R.: The boolean formula value problem is in ALOGTIME. In: STOC, pp. 123–131. ACM, New York (1987)Google Scholar
  7. 7.
    Demri, S., Laroussinie, F., Schnoebelen, P.: A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. 72(4), 547–575 (2006)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Demri, S., Schnoebelen, P.: The complexity of propositional linear temporal logics in simple cases. Inf. Comput. 174(1), 84–103 (2002)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Havelund, K., Roşu, G.: Monitoring programs using rewriting. In: ASE, pp. 135–143. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  10. 10.
    Hemaspaandra, E.: The complexity of poor man’s logic. J. Log. Comput. 11(4), 609–622 (2001)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Hemaspaandra, E., Schnoor, H.: On the complexity of elementary modal logics. In: Albers, S., Weil, P. (eds.) STACS. LIPIcs, vol. 1, pp. 349–360. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)Google Scholar
  12. 12.
    Kuhtz, L.: Model Checking Finite Paths and Trees. PhD thesis, Universität des Saarlandes (2010)Google Scholar
  13. 13.
    Kuhtz, L., Finkbeiner, B.: LTL path checking is efficiently parallelizable. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 235–246. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
    Kupferman, O., Vardi, M.Y.: Relating linear and branching model checking. In: PROCOMET, pp. 304–326. Chapman & Hall, New York (1998)Google Scholar
  15. 15.
    Kučera, A., Strejček, J.: The stuttering principle revisited. Acta Inf. 41(7-8), 415–434 (2005)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6(3), 467–480 (1977)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Proceedings of the Conference on Logic of Programs, pp. 196–218. Springer, London (1985)CrossRefGoogle Scholar
  18. 18.
    Markey, N., Raskin, J.-F.: Model checking restricted sets of timed paths. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 432–447. Springer, Heidelberg (2004)Google Scholar
  19. 19.
    Markey, N., Schnoebelen, P.: Model checking a path (preliminary report). In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 251–265. Springer, Heidelberg (2003)Google Scholar
  20. 20.
    Markey, N., Schnoebelen, P.: Mu-calculus path checking. Inf. Process. Lett. 97(6), 225–230 (2006)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733–749 (1985)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Younes, H.L.S., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 223. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Lars Kuhtz
    • 1
  • Bernd Finkbeiner
    • 2
  1. 1.Microsoft RedmondUSA
  2. 2.Saarland UniversityGermany

Personalised recommendations