Author:
Wang Qiuye,Li Yangjia,Xia Bican,Zhan Naijun
Publisher
Springer Science and Business Media LLC
Subject
Information Systems,Computer Science (miscellaneous)
Reference43 articles.
1. Alur R, Courcoubetis C, Henzinger T, et al., Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems, Proceedings of Hybrid Systems, LNCS, Springer Berlin. Heldelberg, 1992, 736: 209–229.
2. Asarin E, Bournez O, Dang T, et al., Approximate reachability analysis of piecewise-linear dynamical systems, Proceedings of Hybrid Systems: Computation and Control, LNCS, Springer Berlin. Heldelberg, 2000, 1790: 20–31.
3. Lafferriere G, Pappas G, and Yovine S, Symbolic reachability computation for families of linear vector fields. Journal of Symbolic Computation, 2001, 32(3): 231–253.
4. Alur R, Dang T, and Ivancic F, Predicate abstraction for reachability analysis of hybrid systems. ACM Trasactions on Embedded Computing Systems, 2006, 5(1): 152–199.
5. Gan T, Chen M, Dai L, et al., Decidability of the reachability for a family of linear vector fields, Proceedings of International Symposium on Automated Technology for Verification and Analysis, LNCS, Springer Berlin. Heldelberg, 2015, 9364: 482–499.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献