Reachability Problems on Extended O-Minimal Hybrid Automata
暂无分享,去创建一个
[1] P. Kopke. The Theory of Rectangular Hybrid Automata , 1996 .
[2] Thomas A. Henzinger,et al. Computing Accumulated Delays in Real-time Systems , 1993, Formal Methods Syst. Des..
[3] George J. Pappas,et al. Optimal Paths in Weighted Timed Automata , 2001, HSCC.
[4] Kim G. Larsen,et al. Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.
[5] Joseph S. Miller. Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata , 2000, HSCC.
[6] George E. Collins,et al. Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..
[7] A. Wilkie. Schanuel’s Conjecture and the Decidability of the Real Exponential Field , 1997 .
[8] Robert P. Kurshan,et al. Verification of Digital and Hybrid Systems , 2000, NATO ASI Series.
[9] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[10] Thomas A. Henzinger,et al. The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[11] Alex Wilkie,et al. O-MINIMAL STRUCTURES , 2007 .
[12] Jennifer M. Davoren,et al. Topologies, continuity and bisimulations , 1999, RAIRO Theor. Informatics Appl..
[13] Thomas A. Henzinger,et al. Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[14] L. van den Dries,et al. Tame Topology and O-minimal Structures , 1998 .
[15] Thomas Brihaye,et al. On O-Minimal Hybrid Systems , 2004, HSCC.
[16] G. Sacks. A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .
[17] Gerardo Lafferriere,et al. A New Class of Decidable Hybrid Systems , 1999, HSCC.
[18] George J. Pappas,et al. Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.
[19] Pravin Varaiya,et al. What's decidable about hybrid automata? , 1995, STOC '95.
[20] Costas Courcoubetis. Introduction to the Special Issue on Computer-Aided Verification (CAV93) , 1997, Formal Methods Syst. Des..