Skip to main content
SpringerLink
Log in

Verification of duration systems using an approximation approach

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

We consider the verification problem of invariance properties for timed systems modeled by (extended) Timed Graphs with duration variables. This problem is in general case undecidable. Nevertheless we give in this paper a technique extending a given system into another one containing the initial computations as well as additional ones. Then we define a digitization technique allowing the translation from the continuous case to the discrete one. Using this digitization, we show that to each real computation in the initial system corresponds a discrete computation in the extended system. Then, we show that the extended system corresponds to a very close approximation of the initial one, allowing per consequent, a good analysis of invariance properties of the initial system.

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. Alur R, Courcoubetis C, Dill D. Model-checking for real-time systems. InProc. 5th Symp. Logic in Computer Science (LICS'90), Philadelphia USA, IEEE, 1990.

  2. Henzinger T A, Nicollin X, Sifakis J, Yovine S. Symbolic model-checking for real-time systems. InProc. 7th Symp. on Logic in Computer Science (LICS'92), Santa Cruz USA, IEEE, 1992.

  3. Bouajjani A, Echahed R, Robbana R. On the automatic verification of systems with continuous variables and unbounded discrete data structures. InProc. Hybrid Systems and Autonomous Control, (HSAC'95), New York USA, LNCS 999, 1995.

  4. Robbana R. Réduction et vérification de systèmes temps-réel distribués. InColloque Francophone de l'Ingénierie des Protocoles (CFIP'99), Nancy France, 1999.

  5. Chaochen Z, Hoare C A R, Ravn A P. A calculus of durations.Information Processing Letters, 1991, 40: 269–276.

    Article  MATH  MathSciNet  Google Scholar 

  6. Kesten Y, Pnueli A, Sifakis J, Yovine S. Decidable integration graphs.Information and Computation, 1999, 150(2): 209–243.

    Article  MATH  MathSciNet  Google Scholar 

  7. Franck Cassez, Kim G Larsen. The impressive power of stopwatches. InProc. Conference on Concurrency Theory (CONCUR'00), Pennsylvania, USA, 2000.

  8. Abdeddaim Y, Maler O. Preemptive job-shop scheduling using stopwatch automata. InProc. Tools and Algorithm for the Construction and Analysis (TACAS'02), Grenoble, France, 2002.

  9. Alur R, Courcoubetis C, Henzinger T, Ho P H. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. InProc. Hybrid Systems, LNCS 736, Springer-Verlag, 1993.

  10. Bouajjani A, Echahed R, Sifakis J. On model checking for real-time properties with durations. InProc. 8th Symp. Logic in Computer Science (LICS'93), Canada, IEEE, 1993.

  11. Nicollin X, Olivero A, Sifakis J, Yovine S. An approach to the description and analysis of hybrid systems. InProc. Hybrid Systems, LNCS 736, Springer-Verlag, 1993.

  12. Bouajjani A, Lakhnech Y, Robbana R. From duration calculus to linear hybrid systems. InProc. Computer-Aided Verification (CAV'95), Liege Belgium, 1995.

  13. Bouajjani A, Robbana R. Verifying ω-regular properties for subclasses of linear hybrid systems. InProc. Computer-Aided Verification (CAV'95), Liege Belgium, 1995.

  14. Pnueli A, Shahar E. Liveness and acceleration in parameterized verification. InProc. Computer-Aided Verification (CAV'00), Chicago, USA, 2000.

  15. Bouajjani A, Jonsson B, Nilsson M, Touilli T. Regular model checking. InProc. Computer-Aided Verification (CAV'00), Chicago, USA, 2000.

  16. Cerans K. Decidability of bisimulation equivalence for parallel timer processes. InProc. Computer-Aided Verification (CAV'92), Montreal, Canada, LNCS 663, Springer-Verlag, 1992.

  17. Henzinger T A, Kopke P W, Puri A, Varaiya P. What's decidable about hybrid automata?Journal of Computer and System Science, 1998, 57: 94–124.

    Article  MATH  MathSciNet  Google Scholar 

  18. Bouajjani A, Echahed R, Robbana R. Decidability results for the verification problem of pushdown linear hybrid systems. InProc. Hybrid Systems and Autonomous Control, HSAC'94, New York, USA, 1994.

  19. Bouajjani A, Echahed R, Robbana R. Verification of context-free timed systems using linear hybrid observers. InProc. Computer Aided Verification (CAV'94), Stanford, USA, 1994.

  20. Alur R, Courcoubetis C, Halbwachs Net al. The algorithmic analysis of hybrid systems.Theoretical Computer Science, 1995, 138: 3–34.

    Article  MATH  MathSciNet  Google Scholar 

  21. Henzinger T, Manna Z, Pnueli A. What good are digital clocks? InProc. Int. Coll on Automata, Languages and Programming, LNCS 623, Springer-Verlag, 1992.

Download references

Author information

Authors and Affiliations

  1. LIP2 Laboratory, Ecole Polytechnique de Tunisie, rue Elkhawarizmi, 2070, La Marsa, Tunisia

    Riadh Robbana

Authors
  1. Riadh Robbana
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Riadh Robbana.

Additional information

Riadh Robbana holds an Engineering degree in computer science from the Faculty of Science of Tunis in 1991, and a Ph.D. degree in computer science on hybrid systems verification from Joseph Fourier University at grenoble. Currently, he is a lecturer and head of the Department of Applied Mathematics and Computer Science at Ecole Polytechnique of Tunisia. His research interests include formal verification of real-time systems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Robbana, R. Verification of duration systems using an approximation approach. J. Comput. Sci. & Technol. 18, 153–162 (2003). https://doi.org/10.1007/BF02948880

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation