Reachability in One-Dimensional Controlled Polynomial Dynamical Systems
暂无分享,去创建一个
[1] Patricia Bouyer,et al. Control in o-minimal Hybrid Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[2] S. Basu,et al. Algorithms in real algebraic geometry , 2003 .
[3] Amir Pnueli,et al. Low dimensional hybrid systems - decidable, undecidable, don't know , 2012, Inf. Comput..
[4] Nicolai Vorobjov,et al. Pfaffian Hybrid Systems , 2004, CSL.
[5] Amir Pnueli,et al. Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..
[6] Thomas Brihaye. A note on the undecidability of the reachability problem for o-minimal dynamical systems , 2006, Math. Log. Q..
[7] Thomas Brihaye,et al. On the expressiveness and decidability of o-minimal hybrid systems , 2005, J. Complex..
[8] Marie-Françoise Roy,et al. Real algebraic geometry , 1992 .
[9] S. Shankar Sastry,et al. O-Minimal Hybrid Systems , 2000, Math. Control. Signals Syst..
[10] S. Basu,et al. Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) , 2006 .
[11] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.
[12] Nicolai Vorobjov,et al. Computing combinatorial types of trajectories in Pfaffian Dynamics , 2010, J. Log. Algebraic Methods Program..