Advertisement

Model-checking for real-time systems

  • Kim G. Larsen
  • Paul Pettersson
  • Wang Yi
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 965)

Abstract

Efficient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. However, these algorithms are faced with two potential types of explosion arising from parallel composition: explosion in the space of control nodes, and explosion in the region space over clock-variables.

This paper reports on work attacking these explosion problems by developing and combining compositional and symbolic model-checking techniques. The presented techniques provide the foundation for a new automatic verification tool Uppaal. Experimental results show that Uppaal is not only substantially faster than other real-time verification tools but also able to handle much larger systems.

Keywords

Model Check Parallel Composition Atomic Proposition Label Transition System Binary Decision Diagram 
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.
    Martin Abadi and Leslie Lamport. An Old-Fashioned Recipe for Real Time. Lecture Notes in Computer Science, 600, 1993.Google Scholar
  2. 2.
    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
  3. 3.
    R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2): 183–236, April 1994.CrossRefGoogle Scholar
  4. 4.
    H. R. Andersen. Partial Model Checking. To appear in Proceedings of LICS'95, 1995.Google Scholar
  5. 5.
    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
  6. 6.
    K. Cerans, J. C. Godskesen, and K. G. Larsen. Timed modal specifications — theory and tools. Lecture Notes in Computer Science, 697, 1993. In Proceedings of CAV'93.Google Scholar
  7. 7.
    E. M. Clarke, T. Filkorn, and S. Jha. Exploiting Symmetry in Temporal Logic Model Checking. Lecture Notes in Computer Science, 697, 1993. In Proceedings of CAV'93.Google Scholar
  8. 8.
    E. M. Clarke, O. Grümberg, and D. E. Long. Model Checking and Abstraction. Principles of Programming Languages, 1992.Google Scholar
  9. 9.
    C. Daws, A. Olivero, and S. Yovine. Verifying ET-LOTOS programs with KRONOS. In Proceedings of 7th International Conference on Formal Description Techniques, 1994.Google Scholar
  10. 10.
    E. A. Emerson and C. S. Jutla. Symmetry and Model Checking. Lecture Notes in Computer Science, 697, 1993. In Proceedings of CAV'93.Google Scholar
  11. 11.
    P. Godefroid and P. Wolper. A Partial Approach to Model Checking. Logic in Computer Science, 1991.Google Scholar
  12. 12.
    J.C. Godskesen and K.G. Larsen. Synthesizing Distinghuishing Formulae for Real Time Systems — Extended Abstract. Lecture Notes in Computer Science, 1995. To occur in Proceedings of MFCS'95. Also BRICS report series RS-94-48.Google Scholar
  13. 13.
    Nicolas Halbwachs. Delay Analysis in Synchronous Programs. Lecture Notes in Computer Science, 697, 1993. In Proceedings of CAV'93.Google Scholar
  14. 14.
    T. A. Henzinger, Z. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Logic in Computer Science, 1992.Google Scholar
  15. 15.
    Thomas A. Henzinger and Pei-Hsin Ho. HyTech: The Cornell HYbrid TECH-nology Tool. To appear in the Proceedings of TACAS, Workshop on Tools and Algorithms for the Construction and Analysis of Systems, 1995.Google Scholar
  16. 16.
    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
  17. 17.
    F. Laroussinie, K. G. Larsen, and C. Weise. From Timed Automata to Logic — and Back. Lecture Notes in Computer Science, 1995. To occur in Proceedings of MFCS. Also BRICS report series RS-95-2.Google Scholar
  18. 18.
    F. Laroussinie and K.G. Larsen. Compositional Model Checking of Real Time Systems. Lecture Notes in Computer Science, 1995. To appear in Proceedings of CONCUR'95. Also BRICS report series RS-95-19.Google Scholar
  19. 19.
    N. Shankar. Verification of REal-Time Systems Using PVS. Lecture Notes in Computer Science, 697, 1993. In Proceedings of CAV'93.Google Scholar
  20. 20.
    A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Math., 5, 1955.Google Scholar
  21. 21.
    A. Valmari. A Stubborn Attack on State Explosion. Theoretical Computer Science, 3, 1990.Google Scholar
  22. 22.
    Wang Yi, Paul Pettersson, and Mats Daniels. Automatic Verification of Real-Time Systems By Constraint-Solving. In the Proceedings of the 7th International Conference on Formal Description Techniques, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Kim G. Larsen
    • 1
  • Paul Pettersson
    • 2
  • Wang Yi
    • 2
  1. 1.Basic Research in Computer Science, Centre of the Danish National Research FoundationAalborg UniversityDenmark
  2. 2.Uppsala UniversitySweden

Personalised recommendations