Optimal Conditional Reachability for Multi-priced Timed Automata
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Thomas A. Henzinger,et al. HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.
[3] P.A. Abdulla,et al. Better is better than well: on efficient verification of infinite-state systems , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[4] Stavros Tripakis,et al. Algorithms for the Multi-constrained Routing Problem , 2002, SWAT.
[5] Wang Yi,et al. Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.
[6] Stavros Tripakis,et al. Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.
[7] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[8] George J. Pappas,et al. Optimal Paths in Weighted Timed Automata , 2001, HSCC.
[9] Véronique Bruyère,et al. Model-Checking for Weighted Timed Automata , 2004, FORMATS/FTRTFT.
[10] Thomas A. Henzinger,et al. Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.
[11] J. Cheney,et al. A sequent calculus for nominal logic , 2004, LICS 2004.
[12] Yassine Lakhnech,et al. Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems , 2004, Lecture Notes in Computer Science.
[13] Thomas A. Henzinger,et al. Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.
[14] Kim G. Larsen,et al. As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata , 2001, CAV.