Skip to main content

On the automatic verification of systems with continuous variables and unbounded discrete data structures

  • Conference paper
  • First Online:
Hybrid Systems II (HS 1994)

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

Included in the following conference series:

  • 220 Accesses

Abstract

We address the verification problem of invariance properties for hybrid systems. We consider as general models of hybrid systems finite automata, supplied with (unbounded) discrete data structures and continuous variables. We focus on the case of systems manipulating discrete counters and one pushdown stack, and on the other hand, constant slope continuous variables. The use of unbounded discrete data sturcture allows to consider systems with a powerful control, and to reason about important notions as the number of occurrences of events in some computation. The use of constant slope continuous variables allows to reason for instance about the time separating events and the durations of phases within some computation interval. We present decidability results for several subclasses of such models of hybrid systems; this provides automatic verification procedures for these systems.

This paper is based on results previously presented in [BER94a] and [BER94b].

Partially supported by the ESPRIT-BRA project REACT.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. Alur, C. Courcoubetis, and D. Dill. Model-Checking for Real-Time Systems. In 5th Symp. on Logic in Computer Science (LICS'90). IEEE, 1990.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, and T. A. Henzinger. Computing Accumulated Delays in Real-time Systems. In Proc. Intern. Conf. on Computer Aided Verification (CAV'93). LNCS 697, 1993.

    Google Scholar 

  3. R. Alur, C. Courcoubetis, T. Henzinger, and P-H. Ho. Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In Hybrid Systems. LNCS 736, 1993.

    Google Scholar 

  4. A. Bouajjani, R. Echahed, and R. Robbana. Verification of Context-Free Timed Systems using Linear Hybrid Observers. In Proc. Intern. Conf. on Computer Aided Verification (CAV'94). LNCS 818, 1994.

    Google Scholar 

  5. A. Bouajjani, R. Echahed, and R. Robbana. Verifying Invariance Properties of Timed Systems with Duration Variables. In Intern. Symp. on Formal Techniques in Real Time and Fault Tolerant Systems (FTRTFT'94). LNCS 863, 1994.

    Google Scholar 

  6. K. Cerans. Decidability of Bisimulation Equivalence for Parallel Timer Processes. In Proc. Intern. Conf. on Computer Aided Verification (CAV'92). LNCS 663, 1992.

    Google Scholar 

  7. T. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What's Decidable about-Hybrid Automata. In STOC'95, 1995.

    Google Scholar 

  8. T. Henzinger, Z. Manna, and A. Pnueli. What Good are Digital Clocks? In 19th. Intern. Coll. on Automata, Languages and Programming (ICALP'92). LNCS 623, 1992.

    Google Scholar 

  9. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Pub. Comp., 1979.

    Google Scholar 

  10. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid Systems. LNCS 736, 1993.

    Google Scholar 

  11. O. Maler, Z. Manna, and A. Pnueli. From Timed to Hybrid Systems. In REX workshop on Real-Time: Theory and Practice. LNCS 600, 1992.

    Google Scholar 

  12. Z. Manna and A. Pnueli. Verifying Hybrid Systems. In Hybrid Systems. Springer-Verlag, 1993. LNCS 736.

    Google Scholar 

  13. X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An Approach to the Description and Analysis of Hybrid Systems. In Hybrid Systems. LNCS 736, 1993.

    Google Scholar 

  14. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to Timed Graphs and Hybrid Systems. In REX workshop on Real-Time: Theory and Practice. LNCS 600, 1992.

    Google Scholar 

  15. A. Puri and P. Varaiya. Decidability of Hybrid Systems with Rectangular Differential Inclusions. In Proc. Intern. Conf. on Computer Aided Verification (CAV'94). LNCS 818, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Panos Antsaklis Wolf Kohn Anil Nerode Shankar Sastry

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouajjani, A., Echahed, R., Robbana, R. (1995). On the automatic verification of systems with continuous variables and unbounded discrete data structures. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds) Hybrid Systems II. HS 1994. Lecture Notes in Computer Science, vol 999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60472-3_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-60472-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60472-3

  • Online ISBN: 978-3-540-47519-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics