Checking hybrid automata for linear duration invariants
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.
KeywordsReal-time and Hybrid Systems Model-Checking Duration Calculus Linear Programming
Unable to display preview. Download preview PDF.
- 2.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.Google Scholar
- 4.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.Google Scholar
- 6.Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine. Integration Graphs: A Class of Decidable Hybrid Systems. In Hybrid System, LNCS 736, pp.179–208.Google Scholar
- 7.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.Google Scholar
- 8.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.Google Scholar
- 9.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.Google Scholar
- 10.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.Google Scholar