Skip to main content

Compositional model checking of real time systems

  • Session: Model Checking I
  • Conference paper
  • First Online:

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

Abstract

We present a compositional model checking technique for networks of timed automata. This method is based on the same idea as the recent method proposed by Andersen [4] for untimed case. We present a quotient construction, which allows timed automata components to be gradually moved from the network expression into the specification. The intermediate specifications are kept small using minimization heuristics suggested by Andersen. The potential of the combined technique is demonstrated using a prototype implemented in CAML.

This work has been supported by the European Communities under CONCUR2, BRA 7166

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for Real-Time Systems. In Proceedings of Logic in Computer Science, pages 414–425. IEEE Computer Society Press, 1990.

    Google Scholar 

  2. R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183–236, April 1994.

    Article  Google Scholar 

  3. H. R. Andersen. A Polyadic Modal μ-calculus. Id-tr: 1994-145, Department of Computer Science, Technical University of Denmark, 1994.

    Google Scholar 

  4. H. R. Andersen. Partial Model Checking. To appear in Proceedings of LICS'95, 1995.

    Google Scholar 

  5. H. R. Andersen, C. Stirling, and G. Winskel. A Compositional Proof System for the Modal Mu-Calculus. Logic in Computer Science, 1994.

    Google Scholar 

  6. H. R. Andersen and G. Winskel. Compositional checking of satisfaction. Formal Methods in Systems Design, 1992. To appear.

    Google Scholar 

  7. J. H. Andersen, K. J. Kristoffersen, K. G. Larsen, and J. Niedermann. Automatic Synthesis of Real Time Systems. Lecture Notes in Computer Science, 1995. To appear in Proceedings of ICALP'95.

    Google Scholar 

  8. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic Model Checking: 1020 states and beyond. Logic in Computer Science, 1990.

    Google Scholar 

  9. E. M. Clarke, T. Filkorn, and S. Jha. Exploiting Symmetry in Temporal Logic Model Checking. Lecture Notes in Computer Science, 697, 1993.

    Google Scholar 

  10. E. M. Clarke, O. Grümberg, and D. E. Long. Model Checking and Abstraction. Principles of Programming Languages, 1992.

    Google Scholar 

  11. E. A. Emerson and C. S. Jutla. Symmetry and Model Checking. Lecture Notes in Computer Science, 697, 1993.

    Google Scholar 

  12. P. Godefroid and P. Wolper. A Partial Approach to Model Checking. Logic in Computer Science, 1991.

    Google Scholar 

  13. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Logic in Computer Science, 1992.

    Google Scholar 

  14. H. Hüttel and K. G. Larsen. The use of static constructs in a modal process logic. Lecture Notes in Computer Science, Springer Verlag, 363, 1989.

    Google Scholar 

  15. F. Laroussinie and K. G. Larsen. Compositional Model Checking of Real Time Systems. Technical Report RS-95-19, BRICS, 1995. Accessible through WWW: http://www.brics.aau.dk/BRICS.

    Google Scholar 

  16. F. Laroussinie, K. G. Larsen, and C. Weise. From Timed Automata to Logic — and Back. 1995. To appear in Proceedings of MFCS'95.

    Google Scholar 

  17. K.G. Larsen. Context-Dependent Bisimulation Between Processes. PhD thesis, University of Edinburgh, Mayfield Road, Edinburgh, Scotland, 1986.

    Google Scholar 

  18. K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. Journal of Logic and Computation, 1(6):761–795, 1991.

    Google Scholar 

  19. R. Milner. Communication and Concurrency. prentice, Englewood Cliffs, 1989.

    Google Scholar 

  20. F. Moller and C. Tofts. Relating Processes with Respect to Speed. Technical Report ECS-LFCS-91-143, Department of Computer Science, University of Edinburgh, 1991.

    Google Scholar 

  21. D. Park. Concurrency and automata on infinite sequences. In Proceedings of 5th GI Conference, volume 104 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1981. Springer.

    Google Scholar 

  22. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Math., 5, 1955.

    Google Scholar 

  23. A. Valmari. A Stubborn Attack on State Explosion. Theoretical Computer Science, 3, 1990.

    Google Scholar 

  24. W. Yi. A Calculus of Real Time Systems. Lecture Notes in Computer Science, 458, 1990. In Proceedings of CONCUR.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Insup Lee Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laroussinie, F., Larsen, K.G. (1995). Compositional model checking of real time systems. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-60218-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60218-7

  • Online ISBN: 978-3-540-44738-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics