Abstract
We present a methodology for the verification of temporal properties of hybrid systems. The methodology is based on the deductive transformation of hybrid diagrams, which represent the system and its properties, and which can be algorithmically checked against the specification. This check either gives a positive answer to the verification problem, or provides guidance for the further transformation of the diagrams. The resulting methodology is complete for quantifier-free linear-time temporal logic.
The research was supported in part by the National Science Foundation under grant CCR-9527927, by the Defense Advanced Research Projects Agency under contract NAG2-892, by ARO under grant DAAH04-95-1-0317, and by ARO under the MURI grant DAAH04-96-1-0341.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubebetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theor. Comp. Sci., 138(1):3–34, 1995.
R. Alur, C. Courcoubetis, T. Henzinger, and P. Ho. Hybrid automata: An algorithmic approach to the specification and analysis of hybrid systems. In Workshop on Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 209–229. Springer-Verlag, 1993.
Z. Chaochen, A.P. Ravn, and M.R. Hansen. An extended duration calculus for hybrid real-time systems. In Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 36–59. Springer-Verlag, 1993.
L. de Alfaro and Z. Manna. Temporal verification by diagram transformations. In Computer Aided Verification, volume 1102 of Lect. Notes in Comp. Sci., pages 288–299. Springer-Verlag, 1996.
A. Kapur, T.A. Henzinger, Z. Manna, and A. Pnueli. Proving safety properties of hybrid systems. In FTRTFT'94, volume 863 of Lect. Notes in Comp. Sci., pages 431–454. Springer-Verlag, 1994.
Y. Kesten, Z. Manna, and A. Pnueli. Verifying clocked transition systems. In Hybrid Systems III, volume 1066 of Lect. Notes in Comp. Sci., pages 13–40. Springer-Verlag, 1996.
L. Lamport. Hybrid systems in TLA+. In Hybrid Systems, volume 736 of Lect. Notes in Comp. Sci., pages 77–102. Springer-Verlag, 1993.
N.A. Lynch and H. Attiya. Using mappings to prove timing properties. Distributed Computing, 6:121–139, 1992.
O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In Proc. of the REX Workshop “Real-Time: Theory in Practice”, volume 600 of Lect. Notes in Comp. Sci., pages 447–484. Springer-Verlag, 1992.
Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comp. Sci., 83(1):97–130, 1991.
Z. Manna and A. Pnueli. Models for reactivity. Acta Informatica, 30:609–678, 1993.
S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. Found. of Comp. Sci., 1988.
H.B. Sipma, T.E. Uribe, and Z. Manna. Deductive model checking. In Computer Aided Verification, volume 1102, pages 208–219. Springer-Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Alfaro, L., Kapur, A., Manna, Z. (1997). Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023456
Download citation
DOI: https://doi.org/10.1007/BFb0023456
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive