论文信息 - Checking Linear Duration Invariants by Linear Programming - 字舞流文

Checking Linear Duration Invariants by Linear Programming

In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants

Xuandong Li | Dang Van Hung

[1] Joseph Sifakis,et al. Integration Graphs: A Class of Decidable Hybrid Systems , 1992, Hybrid Systems.

[2] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[3] Natarajan Shankar,et al. Towards a Duration Calculus Proof Assistant in PVS , 1994, FTRTFT.

[4] C. A. R. Hoare,et al. A Calculus of Durations , 1991, Inf. Process. Lett..

[5] Chaochen Zhou. Linear Duration Invariants , 1994, FTRTFT.

[6] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .