Skip to main content
SpringerLink
Log in

Is Your Model Checker on Time?

On the Complexity of Model Checking for Timed Modal Logics

  • Conference paper
Mathematical Foundations of Computer Science 1999 (MFCS 1999)

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

Abstract

This paper studies the structural complexity of model checking for (variations on) the specification formalisms used in the tools CMC and Uppaal, and fragments of a timed alternation-free μ-calculus. For each of the logics we study, we characterize the computational complexity of model checking, as well as its specification and program complexity, using timed automata as our system model.

Basic Research in Computer Science.

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. L. Aceto, P. Bouyer, A. Burgueño, and K. G. Larsen, The power of reach ability testing for timed automata, in Proc. of FSTTCS’98, LNCS 1530, December 1998, pp. 245–256.

    Google Scholar 

  2. L. Aceto, A. Burgueño, and K. G. Larsen, Model checking via reachability testing for timed automata, in Proc. of TACAS’ 98, LNCS 1384, April 1998, pp. 263–280.

    Google Scholar 

  3. R. Alur, Techniques for Automatic Verification of Real-time Systems, PhD thesis, Stanford University, 1991.

    Google Scholar 

  4. R. Alur, C. Courcoubetis, and D. Dill, Model-checking in dense real-time, Information and Computation, 104 (1993), pp. 2–34.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Alur and D. Dill, A theory of timed automata, Theoretical Computer Science, 126 (1994), pp. 183–235.

    Article  MATH  MathSciNet  Google Scholar 

  6. O. Bernholtz, M. Y. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, in Proc. of the 6th. International Conference on Computer-Aided Verification, CAV’94, D. Dill, ed., vol. 818 of Lecture Notes in Computer Science, California, USA, June 1994, Stanford, Springer-Verlag.

    Google Scholar 

  7. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, Alternation, J. Assoc. Comput. Mach., 28 (1981), pp. 114–133.

    MATH  MathSciNet  Google Scholar 

  8. E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verification of finite state concurrent system using temporal logic, ACM Trans. on Programming Languages and Systems, 8 (1986), pp. 244–263.

    Article  MATH  Google Scholar 

  9. R. Cleaveland, A linear-time model-checking algorithm for the alternation-free modal μ-calculus, Formal Methods in Systems Design, 2 (1993), pp. 121–147.

    Article  MATH  Google Scholar 

  10. C. Courcoubetis and M. Yannakakis, Minimum and maximum delay problems in real-time systems, Formal Methods in System Design, (1992), pp. 385–415.

    Google Scholar 

  11. S. Demri and P. Schnoebelen, The complexity of propositional linear temporal logics in simple cases (extended abstract), in Proc. 15th Ann. Symp. Theoretical Aspects of Computer Science (STACS’98), LNCS 1373, Paris, France, Feb. 1998, Springer Verlag, 1998, pp. 61–72.

    Google Scholar 

  12. S. Dziembowski, M. Jurdziński, and D. Niwiński, On the expression complexity of the modal μ-calculus model checking. Unpublished manuscript, November 1996.

    Google Scholar 

  13. E. A. Emerson, C. S. Jutla, and A. P. Sistla, On model-checking for fragments of μ-calculus, in Proceedings of the Fifth International Conference Computer Aided Verification, Elounda, Greece, July 1993, C. Courcoubetis, ed., vol. 697 of Lecture Notes in Computer Science, Springer-Verlag, 1993, pp. 385–396.

    Google Scholar 

  14. M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach., 32 (1985), pp. 137–161.

    MATH  MathSciNet  Google Scholar 

  15. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic model checking for real-time systems, Information and Computation, 111 (1994), pp. 193–244.

    Article  MATH  MathSciNet  Google Scholar 

  16. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27 (1983), pp. 333–354.

    Article  MATH  MathSciNet  Google Scholar 

  17. F. Laroussinie and K. G. Larsen, CMC: A tool for compositional model-checking of real-time systems, in Proc. IFIP Joint Int. Conf. Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE-PSTV’98), Kluwer Academic Publishers, 1998, pp. 439–456.

    Google Scholar 

  18. F. Laroussinie, K. G. Larsen, and C. Weise, From timed automata to logic-and back, in Proc. of the 20th. International Symposium on Mathematical Foundations of Computer Science, MFCS’95, J. Wiedermann and P. Hájek, eds., vol. 969 of Lecture Notes in Computer Science, Prague, Czech Republic, August 28–September 1 1995, Springer-Verlag, pp. 529–539.

    Google Scholar 

  19. K. G. Larsen, P. Pettersson, and W. Yi, Model-checking for real-time systems, in Proceedings of the 10th International Conference on Fundamentals of Computation Theory, H. R. (Ed.), ed., Dresden, Germany, August 1995, LNCS 965, pp. 62–88.

    Google Scholar 

  20. —, UPPAAL in a Nutshell, Journal of Software Tools for Technology Transfer, 1 (1997), pp. 134–152.

    Article  MATH  Google Scholar 

  21. O. Lichtensteln and A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, in Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, Jan. 1985, pp. 97–107.

    Google Scholar 

  22. A. P. Sistla and E. M. Clarke, The complexity of propositional linear temporal logics, J. Assoc. Comput. Mach., 32 (1985), pp. 733–749.

    MATH  MathSciNet  Google Scholar 

  23. T.A. Henzinger and P.-H. Ho, and H. Wong-Toi, HyTech: A Model Checker for Hybrid Systems, Journal of Software Tools for Technology Transfer, 1 (1997), pp. 110–122.

    Article  MATH  Google Scholar 

  24. S. Yovine, Kronos: A Verification Tool for real-Time Systems, Journal of Software Tools for Technology Transfer, 1 (1997), pp. 123–133.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Department of Computer Science, Aalborg University, Fredrik Bajers Vej 7-E, DK-9220, Aalborg Ø, Denmark

    Luca Aceto

  2. Laboratoire Spécification et Vérification, CNRS UMR 8643, ENS de Cachan, 61 av. du Pr. Wilson, 94235, Cachan, France

    François Laroussinie

Authors
  1. Luca Aceto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. François Laroussinie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Przesmyckiego 20, PL-51-151, Wrocław, Poland

    Mirosław Kutyłowski , Leszek Pacholski  & Tomasz Wierzbicki ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aceto, L., Laroussinie, F. (1999). Is Your Model Checker on Time?. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-48340-3_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66408-6

  • Online ISBN: 978-3-540-48340-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation