Abstract
In this paper, we consider the problem of checking hybrid systems modelled by hybrid automata for a class of real-time properties represented by linear duration invariants, which are constructed from linear inequalities of integrated durations of system states. Based on linear programming, an algorithm is developed for solving the problem for a class of hybrid automata.
On leave from Department of Computer Science, Nanjing University, Nanjing 210093, P.R.China. Partly supported by National NSF of China.
On leave from the Institute of Information Technology, Nghia Do, TuLiem, Hanoi, Vietnam.
On leave from Department of Computer Science, Nanjing University, Nanjing 210093, P.R.China. Partly supported by National NSF of China.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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. The theory of hybrid automata. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 278–292.
Zhou Chaochen, C.A.R. Hoare, A.P. Ravn. A Calculus of Durations. In Information Processing Letter, 40, 5, 1991, pp.269–276.
Zhou Chaochen, Zhang Jingzhong, Yang Lu and Li Xiaoshan. Linear Duration Invariants. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pp.88–109.
Rajeev Alur, David L. Dill. A theory of timed automata. In Theoretical Computer Science, 126 (1994), pp.183–235.
Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine. Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid System, LNCS 736, pp.179–208.
S.C. Kleene. Representation of Events in Nerve Nets and Finite Automata. In Automata Studies, C.Shannon and J. McCarthy (eds.), Princeton Univ. Press, Princeton, NJ, 1956, pp.3–41.
J.U. Skakkebaek and N. Shankar. Towards a Duration Calculus proof assistant in PVS. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, pp.660–697.
Li Xuandong, Dang Van Hung. Checking Linear Duration Invariants by Linear Programming. In Concurrence and Parallelism, Programming, Networking, and Security, LNCS 1179, pp.321–332.
Li Xuandong, Dang Van Hung, Zheng Tao. Checking Hybrid Automata for Linear Duration Invariants. Research report 109, UNU/IIST, P.O.Box 3058, Macau, June 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xuandong, L., Van Hung, D., Tao, Z. (1997). Checking hybrid automata for linear duration invariants. In: Shyamasundar, R.K., Ueda, K. (eds) Advances in Computing Science — ASIAN'97. ASIAN 1997. Lecture Notes in Computer Science, vol 1345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63875-X_51
Download citation
DOI: https://doi.org/10.1007/3-540-63875-X_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63875-9
Online ISBN: 978-3-540-69658-2
eBook Packages: Springer Book Archive