Skip to main content
SpringerLink
Log in

Model Checking a Path

  • Conference paper
Book cover CONCUR 2003 - Concurrency Theory (CONCUR 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2761))

Included in the following conference series:

Abstract

We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved efficiently, and profit from specialized algorithms. We further show it is possible to efficiently check paths given in compressed form.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bérard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., Schnoebelen, P.: Systems and Software Verification. Model-Checking Techniques and Tools. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  2. Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. In: Highly Dependable Software. Advances in Computers, vol. 58. Academic Press, London (2003)

    Google Scholar 

  3. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  4. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational databases. In: Proc. 9th ACM Symp. Theory of Computing (STOC 1977), Boulder, CO, USA, 1977, May 1977, pp. 77–90 (1977)

    Google Scholar 

  5. Drusinsky, D.: The Temporal Rover and the ATG Rover. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, pp. 323–330. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Demri, S., Schnoebelen, P.: The complexity of propositional linear temporal logics in simple cases. Information and Computation 174(1), 84–103 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. ch. 16, vol. B, pp. 995–1072. Elsevier Science, Amsterdam (1990)

    Google Scholar 

  8. Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. In: Proc. 1st Int. Workshop on Runtime Verification (RV 2001), Paris, France, DK, July 2001. Electronic Notes in Theor. Comp. Sci., vol. 55(2), Elsevier Science, Amsterdam (2001)

    Google Scholar 

  9. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  10. Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Proc. 7th ACM Symp. Principles of Programming Languages (POPL 1980), Las Vegas, NV, USA, 1980, January 1980, pp. 163–173 (1980)

    Google Scholar 

  11. Havelund, K.: Using runtime analysis to guide model checking of Java programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, pp. 245–264. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Harel, D., Kozen, D.C., Parikh, R.: Process logic: Expressiveness, decidability, completeness. In: Proc. 21st IEEE Symp. Foundations of Computer Science (FOCS 1980), Syracuse, NY, USA, 1980, October 1980, pp. 129–142 (1980)

    Google Scholar 

  13. Harel, D., Kupferman, O., Vardi, M.Y.: On the complexity of verifying concurrent transition systems. Information and Computation 173(2), 143–161 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: Proc. 17th IEEE Symp. Logic in Computer Science (LICS 2002), Copenhagen, Denmark, 2002, July 2002, pp. 383–392. IEEE Comp. Soc. Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  15. Lassaigne, R., Peyronnet, S.: Approximate verification of probabilistic systems. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 213–214. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Markey, N.: Past is for free: on the complexity of verifying linear temporal properties with past. In: Proc. 9th Int. Workshop on Expressiveness in Concurrency (EXPRESS 2002), Brno, Czech Republic, August 2002. Electronic Notes in Theor. Comp. Sci., vol. 68.2. Elsevier Science, Amsterdam (2002)

    Google Scholar 

  17. Markey, N., Schnoebelen, P.: A PTIME-complete problem for SLPcompressed words (2003) (submitted for publication)

    Google Scholar 

  18. Plandowski, W., Rytter, W.: Complexity of language recognition problems for compressed words. In: Karhumaki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 262–272. Springer, Heidelberg (1999)

    Google Scholar 

  19. Rabinovich, A.: Expressive power of temporal logics. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 57–75. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Roger, M., Goubault-Larrecq, J.: Log auditing through model checking. In: Proc. 14th IEEE Computer Security Foundations Workshop (CSFW 2001), Cape Breton, Nova Scotia, Canada, 2001, June 2001, pp. 220–236. IEEE Comp. Soc. Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  21. Rosenstein, J.G.: Linear Orderings. Academic Press, London (1982)

    MATH  Google Scholar 

  22. Rosner, R., Pnueli, A.: A choppy logic. In: Proc. 1st IEEE Symp. Logic in Computer Science (LICS 1986), Cambridge, MA, USA, 1986, June 1986, pp. 306–313. IEEE Comp. Soc. Press, Los Alamitos (1986)

    Google Scholar 

  23. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. Journal of the ACM 32(3), 733–749 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  24. Schnoebelen, P.: The complexity of temporal logic model checking. In: Advances in Modal Logic, papers from 4th Int. Workshop on Advances in Modal Logic (AiML 2002), September-October 2002, Toulouse, France. World Scientific, Singapore (2003) (to appear)

    Google Scholar 

  25. Stockmeyer, L.J.: The complexity of decision problems in automata and logic. PhD thesis, MIT (1974)

    Google Scholar 

  26. 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, pp. 223–235. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. d’Informatique Fondamentale d’Orléans, Univ. Orléans & CNRS, FRE 2490

    N. Markey

  2. Lab. Spécification & Vérification, ENS de Cachan & CNRS, UMR 8643

    N. Markey & P. Schnoebelen

Authors
  1. N. Markey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Paris 7, PPS, Case 7014, 75205, Paris Cedex 13, France

    Roberto Amadio

  2. LIF, CNRS, Aix-Marseille Université, France

    Denis Lugiez

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Markey, N., Schnoebelen, P. (2003). Model Checking a Path. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45187-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40753-9

  • Online ISBN: 978-3-540-45187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation