Chaochen, 1991, A calculus of durations, Information Processing Letter, 40, 269, 10.1016/0020-0190(91)90122-X
Henzinger, 1996, The theory of hybrid automata, 278
Alur, 1995, The algorithmic analysis of hybrid systems, Theoretical Computer Science, 138, 3, 10.1016/0304-3975(94)00202-T
Chaochen, 1994, Linear duration invariants, vol. 863, 88
Kesten, 1999, Decidable integration graphs, Information and Computation, 150, 209, 10.1006/inco.1998.2774
T.A. Henzinger, P.W. Kopke, Anuj Puri, Pravin Varaiya, What’s decidable about hybrid automata? Journal of Computer and System Sciences 57 (1998) 94–124
Henzinger, 2000, Symbolic model checking for rectangular hybrid systems
Henzinger, 1997, HYTECH: a model checker for hybrid systems, Software Tools for Technology Transfer, 1, 110, 10.1007/s100090050008
Alur, 1993, Computing accumulated delays in real-time systmes, vol. 818, 181
Alur, 1994, A theory of timed automata, Theoretical Computer Science, 126, 183, 10.1016/0304-3975(94)90010-8
Henzinger, 1998, Algorithmic analysis of nonlinear hybrid systems, IEEE Transactions on Automatic Control, 43, 540, 10.1109/9.664156
Henzinger, 1998, Reachability verification for hybrid automata, vol. 1386, 190
Halbwachs, 1994, Verification of linear hybrid systems by means of convex approximations
Avrunin, 1998, Analyzing partially-implemented real-time systems, IEEE Transactions on Software Engineering, 24, 602, 10.1109/32.707696
Asarin, 1997, A Kleene theorem for timed automata, 160
Jianhua, 1998, On checking parallel real-time systems for linear duration properties, vol. 1486, 241
Z. Jianhua, D. Van Hung, Checking timed automata for some discretisable duration properties, Research Report 145, UNU/IIST, Macau, 1998
Xuandong, 2001, Efficient verification of a class of linear hybrid automata using linear programming, vol. 2144, 465
Xuandong, 1997, Checking hybrid automata for linear duration invariants, vol. 1345, 166
Xuandong, 1998, Hybrid regular expressions, vol. 1386, 384