Abstract
In this paper, we show that for a class of linear hybrid automata called zero loop-closed automata, the satisfaction problem for linear duration properties can be solved efficiently by linear programming. We give an algorithm based on depth-first search method to solve the problem by traversing all the simple paths (with no repeated node occurrence) in an automaton and checking their corresponding sequences of locations for a given linear duration property.
This work is supported by the National Natural Science Foundation of China under Grant 60073031 and Grant 69703009, and by International Institute for Software Technology, The United Nations University (UNU/IIST).
Chapter PDF
Similar content being viewed by others
References
Thomas A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 278–292.
Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine. Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid System, LNCS 736, pp. 179–208.
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine. The algorithmic analysis of hybrid systems. In Theoretical Computer Science, 138(1995), pp. 3–34.
Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What’s Decidable About Hybrid Automata? In Journal of Computer and System Sciences, 57:94–124, 1998.
Zhou Chaochen, C.A.R. Hoare, A.P. Ravn. A Calculus of Durations. In Information Processing Letter, 40,5, 1991, pp. 269–276.
C. Zhou, J. Zhang, L. Yang, and X. Li. Linear Duration Invariants. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pp. 88–109.
Thomas A. Henzinger, Rupak Majumdar. Symbolic Model Checking for Rectangular Hybrid Systems. In Proceedings of the Sixth Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 00), Lecture Notes in Computer Science, Springer, 2000.
T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: a model checker for hybrid systems. In Software Tools for Technology Transfer, 1:110–122, 1997.
Li Xuandong, Dang Van Hung, and Zheng Tao. Checking Hybrid Automata for Linear Duration Invariants. In Advances in Computing Science-ASIAN’97, LNCS 1345, Springer-Verlag, 1997, pp. 166–1180.
Li Xuandong, Zheng Tao, Hou Jianmin, Zhao Jianhua, and Zheng Guoliang. Hybrid Regular Expressions. In Hybrid Systems: Computation and Control, LNCS 1386, Springer-Verlag, 1998, pp. 384–399.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xuandong, L., Yu, P., Jianhua, Z., Yong, L., Tao, Z., Guoliang, Z. (2001). Efficient Verification of a Class of Linear Hybrid Automata Using Linear Programming. In: Margaria, T., Melham, T. (eds) Correct Hardware Design and Verification Methods. CHARME 2001. Lecture Notes in Computer Science, vol 2144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44798-9_35
Download citation
DOI: https://doi.org/10.1007/3-540-44798-9_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42541-0
Online ISBN: 978-3-540-44798-6
eBook Packages: Springer Book Archive