Skip to main content
SpringerLink
Log in

An iterative approach to verification of real-time systems

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

Verification of real-time systems is a complex problem, requiring construction of aregion automaton with a state space growing exponentially in the number of timing constraints and the sizes of constants in those constraints. However, some properties can be verified even when some quantitative timing information is abstracted. We propose a new verification procedure, where increasingly more complex abstractions of the region automaton are iteratively constructed. In many cases, the procedure can be stopped early, and thus can avoid the state space explosion problem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Rajeev Alur, Costas Courcoubetis, and David L. Dill. Model-checking for real-time systems. InProceedings of 5th LICS, pages 414–425, June 1992.

  2. Rajeev Alur, Costas Courcoubetis, Nicholas Halbwachs, David L. Dill, and Howard Wong-Toi. Minimization of timed transition systems. InProceedings of CONCUR'92, August 1992.

  3. Rajeev Alur and David L. Dill. Automata for modelling real-time systems. In M.S. Paterson, editor,ICALP'90 Automata, languages, and programming: 17th international colloquium. Springer-Verlag, 1990. LNCS vol. 443.

  4. Rajeev Alur, Alon Itai, R. P. Kurshan, and M. Yannakakis. Timing verification by successive approximation. In G. v. Bochmann and D.K. Probst, editors,Proceedings of Computer Aided Verification: 4th International Workshop, CAV'92, Montreal, Canada, June 29-July 1, 1992. Springer-Verlag, 1993. LNCS vol. 663.

  5. Felice Balarin and Alberto L. Sangiovanni-Vincentelli. Formal verification of timing constrained finitestate systems. Technical Report UCB ERL M92/8, University of California Berkeley, 1992.

  6. Felice Balarin and Alberto L. Sangiovanni-Vincentelli. A verification strategy for timing constrained systems. In G. v. Bochmann and D.K. Probst, editors,Proceedings of Computer Aided Verification: 4th International Workshop, CAV'92, Montreal, Canada, June 29–July 1, 1992, pages 151–63. Springer-Verlag, 1993. LNCS vol. 663.

  7. Edmund M. Clarke, Orna Grumberg, and David E. Long. Model checking and abstraction. InProc. Principles of Programming Languages, January 1992.

  8. Costas Courcoubetis, David L. Dill, M. Hatzaki, and Panagiotis Tzounakis. Verification with real-time COSPAN. In G. v. Bochmann and D.K. Probst, editors,Proceedings of Computer Aided Verification: 4th International Workshop, CAV'92, Montreal, Canada, June 29–July 1, 1992. Springer-Verlag, 1993. LNCS vol. 663.

  9. David L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Joseph Sifakis, editor,Automatic Verification Methods for Finite-State Systems. Springer-Verlag, 1989. LNCS vol. 407.

  10. Z. Har'El and R. P. Kurshan. Software for analysis of coordination. InProceedings of the International Conference of System Science, pages 382–385, 1988.

  11. Thomas A. Henzinger, Xavier Nicolin, Jospeh Sifakis, and Sergio Yovine. Symbolic model-checking for real-time systems. InProceedings of 7th Symposium on Logics in Computer Science. IEEE Computer Society Press, 1992.

  12. Ramin Hojati, Herve Touati, R. P. Kurshan, and Robert K. Brayton, Efficient ω-regular language containment. In G. v. Bochmann and D.K. Probst, editors,Proceedings of Computer Aided Verification: 4th International Workshop, CAV'92, Montreal, Canada, June 29–July 1, 1992. Springer-Verlag, 1993. LNCS vol. 663.

  13. R. P. Kurshan. Automata-theoretic verification of coordinating processes. To be published.

  14. R. P. Kurshan. Analysis of discrete event coordination. In J. W. de Bakker, W.P. de Roever, and G. Rozenberg, editors,Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, pages 414–453. Springer-Verlag, 1990. LNCS vol. 430.

  15. R. P. Kurshan, 1991. private communications.

  16. Robert Endre Tarjan.Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of California, 94720, Berkeley, CA, USA

    Felice Balarin & Alberto L. Sangiovanni-Vincentelli

Authors
  1. Felice Balarin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto L. Sangiovanni-Vincentelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balarin, F., Sangiovanni-Vincentelli, A.L. An iterative approach to verification of real-time systems. Form Method Syst Des 6, 67–95 (1995). https://doi.org/10.1007/BF01384315

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01384315

Keywords

Search

Navigation