Author:
He Lulu,Ye Lina,Dague Philippe
Subject
Control and Systems Engineering
Reference28 articles.
1. A theory of timed automata;Alur;Theor. Comput. Sci.,1994
2. Badban, B. and Lange, M. (2011). Exact incremental analysis of timed automata with an smt-solver. In Proceedings of International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'11), volume 6919 of Lecture Notes in Computer Science. Springer.
3. Bengtsson, J. and Yi, W. (2003). On clock difference constraints and termination in reachability analysis of timed automata. In Proceedings of the 5th International Conference on Formal Engineering Methods (ICFEM'2003), volume 2885 of Lecture Notes in Computer Science, 491-503. Springer.
4. Bertrand, N., Fabre, E., Haar, S., Haddad, S., and Hélouët, L. (2014). Active diagnosis for probabilistic systems. In A. Muscholl (ed.), Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), volume 8412 of Lecture Notes in Computer Science, 29-42. Springer, Grenoble, France.
5. Bittner, B., Bozzano, M., and Cimatti, A. (2016a). Automated synthesis of timed failure propagation graphs. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI'16), 972-978.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献