Abstract
This paper presents a computational technique for verifying properties of hybrid systems with arbitrary continuous dynamics. The approach is based on the computation of approximating automata, which are finite-state approximations to the (possibly infinite-state) discretetrace transition system for the hybrid system. The fundamental computation in the generation of approximating automata is the mapping of sets of continuous states to the boundaries of the location invariants. This mapping is computed by intersecting flow pipes, the sets of reachable states for continuous systems, with the invariant boundaries. Flow pipes are approximated by sequences of overlapping convex polygons. The paper presents an application of the computational procedure to a benchmark hybrid system, a batch evaporator.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Trans. on Software Engineering, 22(3):181–201, Mar 1996.
A. Chutinan and B.H. Krogh. Computing approximating automata for a class of hybrid systems. submitted to Mathematical Modeling of Systems: Special Issue on Discrete Event Models of Continuous Systems, 1997.
A. Chutinan and B.H. Krogh. Computing approximating automata for a class of linear hybrid systems. In Hybrid Systems V, Lecture Notes in Computer Science. Springer-Verlag, 1998.
A. Chutinan and B.H. Krogh. Computing polyhedral approximations to dynamic flow pipes. submitted to 37 th IEEE Conference on Decision and Control: Invited Session on Synthesis and Verification of Controllers for Hybrid Systems, 1998.
E. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In Proceedings of A Decade of Concurrency: Reflections and Perspectives, pages 124–175, REX School/Symposium, Noordwijkerhout, The Netherlands, 1–4 June 1993. Springer-Verlag, Berlin, Germany, 1994.
T.A. Henzinger. Hybrid automata with finite bimulations. In Z. Fülöp and F. Gécseg, editors, ICALP 95: Automata, Languages, and Programming, pages 324–335. Springer-Verlag, 1995.
T.A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 278–292. IEEE Computer Society Press, 1996. Invited tutorial.
S. Kowalewski and O. Stursberg. The batch evaporator: A benchmark example for safety analysis of processing systems under logic control. submitted to: 4th Int. Workshop on Discrete Event Systems (WODES’ 98), Cagliari (Italy), August 1998.
B.H. Krogh and A. Chutinan. Hybrid systems: Modeling and control. In P.M. Frank, editor, Advances in Control. Springer-Verlag, 1999. To appear.
G. Lafferriere, G. J. Pappas, and S. Sastry. Hybrid systems with finite bisimulations. Technical Report UCB/ERL M98/15, University of California at Berkeley, April 1998.
G. Lafferriere, G. J. Pappas, and S. Yovine. Decidable hybrid systems. Technical Report UCB/ERL M98/39, University of California at Berkeley, June 1998.
Feng Zhao. Automatic Analysis and Synthesis of Controllers for Dynamical Systems Based on Phase-Space Knowledge. PhD thesis, MIT Artificial Intelligence Laboratory, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chutinan, A., Krogh, B.H. (1999). Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations. In: Vaandrager, F.W., van Schuppen, J.H. (eds) Hybrid Systems: Computation and Control. HSCC 1999. Lecture Notes in Computer Science, vol 1569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48983-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-48983-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65734-7
Online ISBN: 978-3-540-48983-2
eBook Packages: Springer Book Archive