Skip to main content

Non-convex Invariants and Urgency Conditions on Linear Hybrid Automata

  • Conference paper
Formal Modeling and Analysis of Timed Systems (FORMATS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8711))

Abstract

Linear hybrid automata (LHAs) are of particular interest to formal verification because sets of successor states can be computed exactly, which is not the case in general for more complex dynamics. Enhanced with urgency, LHA can be used to model complex systems from a variety of application domains in a modular fashion. Existing algorithms are limited to convex invariants and urgency conditions that consist of a single constraint. Such restrictions can be a major limitation when the LHA is intended to serve as an abstraction of a model with urgent transitions. This includes deterministic modeling languages such as Matlab-Simulink, Modelica, and Ptolemy, since all their transitions are urgent. The goal of this paper is to remove these limitations, making LHA more directly and easily applicable in practice. We propose an algorithm for successor computation with non-convex invariants and closed, linear urgency conditions. The algorithm is implemented in the open-source tool PHAVer, and illustrated with an example.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Henzinger, T., Ho, P.H.: Automatic symbolic verification of embedded systems. IEEE Trans. Softw. Eng. 22, 181–201 (1996)

    Article  Google Scholar 

  2. Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming 72(1-2), 3–21 (2008)

    Article  MathSciNet  Google Scholar 

  3. Bauer, N., Kowalewski, S., Sand, G., Löhl, T.: A case study: Multi product batch plant for the demonstration of control and scheduling problems. In: Engell, S., Kowalewski, S., Zaytoon, J. (eds.) ADPM 2000, pp. 383–388. Shaker (2000)

    Google Scholar 

  4. van Beek, D.A., Reniers, M.A., Schiffelers, R.R.H., Rooda, J.E.: Foundations of a compositional interchange format for hybrid systems. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 587–600. Springer, Heidelberg (2007)

    Google Scholar 

  5. Behrmann, G., David, A., Larsen, K.G.: A tutorial on uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Benerecetti, M., Faella, M., Minopoli, S.: Automatic synthesis of switching controllers for linear hybrid systems: Safety control. TCS 493, 116–138 (2012)

    Article  MathSciNet  Google Scholar 

  7. Buck, J.T., Ha, S., Lee, E.A., Messerschmitt, D.G.: Ptolemy: A framework for simulating and prototyping heterogeneous systems. Ablex Publishing Corp. (1994)

    Google Scholar 

  8. Frehse, G., Le Guernic, C., Donzé, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Girard, A., Dang, T., Maler, O.: SpaceEx: Scalable verification of hybrid systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379–395. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Frehse, G.: PHAVer: algorithmic verification of hybrid systems past HyTech. STTT 10(3), 263–279 (2008)

    Article  MathSciNet  Google Scholar 

  10. Gebremichael, B., Vaandrager, F.: Specifying urgency in timed i/o automata. In: SEFM 2005, pp. 64–74. IEEE Computer Society (2005)

    Google Scholar 

  11. Henzinger, T.A., Ho, P.H., Wong-Toi, H.: Hytech: the next generation. In: Proc. IEEE Real-Time Systems Symposium, p. 56. IEEE Computer Society (1995)

    Google Scholar 

  12. Henzinger, T.: The theory of hybrid automata. In: 11th IEEE Symp. Logic in Comp. Sci., pp. 278–292 (1996)

    Google Scholar 

  13. Ho, P.H.: Automatic Analysis of Hybrid Systems. Ph.D. thesis, Cornell University, technical Report CSD-TR95-1536 (August 1995)

    Google Scholar 

  14. MathWorks: Mathworks simulink: Simulation et model-based design (Mar 2014), http://www.mathworks.fr/products/simulink

  15. Mattsson, S.E., Elmqvist, H., Otter, M.: Physical system modeling with Modelica. Control Engineering Practice 6(4), 501–510 (1998)

    Article  Google Scholar 

  16. Minopoli, S., Frehse, G.: Non-convex invariants and urgency conditions on linear hybrid automata. Tech. Rep. TR-2014-4, Verimag (April 2014)

    Google Scholar 

  17. Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: An approach to the description and analysis of hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 149–178. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  18. Wong-Toi, H.: The synthesis of controllers for linear hybrid automata. In: IEEE Conf. Decision and Control, pp. 4607–4612. IEEE (1997)

    Google Scholar 

  19. De Wulf, M., Doyen, L., Raskin, J.-F.: Almost ASAP semantics: From timed models to timed implementations. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 296–310. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Minopoli, S., Frehse, G. (2014). Non-convex Invariants and Urgency Conditions on Linear Hybrid Automata. In: Legay, A., Bozga, M. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2014. Lecture Notes in Computer Science, vol 8711. Springer, Cham. https://doi.org/10.1007/978-3-319-10512-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10512-3_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10511-6

  • Online ISBN: 978-3-319-10512-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics