R. Alur, C. Courcoubetis, T. A. Henzinger & P. H. Ho (1993):
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems.
In: Hybrid Systems,
LNCS 736.
Springer,
pp. 209–229,
doi:10.1007/3-540-57318-6_30.
J. P. Aubin & A. Cellina (1984):
Differential Inclusions.
A Series of Comprehensive Studies in Mathematics 264.
Springer,
doi:10.1007/978-3-642-69512-4.
S. Basu (1997):
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields.
In: IEEE Symposium on Foundations of Computer Science (FOCS'97).
IEEE Computer Society Press,
pp. 56–65,
doi:10.1109/SFCS.1997.646093.
A. Casagrande, T. Dreossi & C. Piazza (2012):
Hybrid Automata and ε-Analysis on a Neural Oscillator.
In: Proc. of the 1st International Workshop on Hybrid Systems and Biology,
EPTCS 92,
pp. 58–72,
doi:10.4204/EPTCS.92.5.
A. Casagrande, C. Piazza & A. Policriti (2009):
Discrete Semantics for Hybrid Automata.
Discrete Event Dynamic Systems 19(4),
pp. 471–493,
doi:10.1007/s10626-009-0082-7.
A. Casagrande, C. Piazza, A. Policriti & B. Mishra (2008):
Inclusion dynamics hybrid automata.
Information and Computation 206(12),
pp. 1394–1424,
doi:10.1016/j.ic.2008.09.001.
Pieter Collins (2005):
Hybrid Trajectory Spaces.
Technical Report.
Centrum voor Wiskunde en Informatica (CWI).
J. Davoren & I. Epstein (2008):
Topologies, Convergence, and Uniformities in General Hybrid Path Spaces,.
Preprint.
M. Fränzle (1999):
Analysis of Hybrid Systems: An ounce of realism can save an infinity of states.
In: Computer Science Logic (CSL'99),
LNCS 1683.
Springer,
pp. 126–140,
doi:10.1007/3-540-48168-0_10.
A. Girard, A. A. Julius & G. J. Pappas (2008):
Approximate Simulation Relations for Hybrid Systems.
Discrete Event Dynamic Systems 18(2),
pp. 163–179,
doi:10.1007/s10626-007-0029-9.
T. A. Henzinger, P. W. Kopke, A. Puri & P. Varaiya (1995):
What's decidable about hybrid automata?.
In: Proc. of ACM Symposium on Theory of Computing (STOCS'95).
ACM,
pp. 373–382,
doi:10.1145/225058.225162.
T. A. Henzinger & J.-F. Raskin (2000):
Robust Undecidability of Timed and Hybrid Systems.
In: Proc. of the 3rd International Workshop Hybrid Systems: Computation and Control (HSCC'00),
LNCS 1790.
Springer,
pp. 145–159,
doi:10.1007/3-540-46430-1_15.
G. Lafferriere, G. J. Pappas & S. Sastry (2000):
O-minimal Hybrid Systems.
Mathematics of Control, Signals, and Systems 13,
pp. 1–21,
doi:10.1007/PL00009858.
G. Lafferriere, G. J. Pappas & S. Yovine (2001):
Symbolic Reachability Computation for Families of Linear Vector Fields.
J. Symb. Comput. 32(3),
pp. 231–253,
doi:10.1006/jsco.2001.0472.
B. Mendelson (1990):
Introduction to Topology,
III edition.
Dover Books on Mathematics.
E. Mendelson (1997):
Introduction to Mathematical Logic,
IV edition.
CRC Press.
C. Piazza, M. Antoniotti, V. Mysore, A. Policriti, F. Winkler & B. Mishra (2005):
Algorithmic Algebraic Model Checking I: The Case of Biochemical Systems and their Reachability Analysis.
CIMS-TR 2005-859.
Courant Institute Of Mathematical Sciences.
P. Prabhakar, V. Vladimerou, M. Viswanathan & G. E. Dullerud (2009):
Verifying Tolerant Systems Using Polynomial Approximations.
In: Proc. of the 30th IEEE Real-Time Systems Symposium (RTSS'09).
IEEE Computer Society Press,
pp. 181–190,
doi:10.1109/RTSS.2009.28.
S. Ratschan (2010):
Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable.
In: Proc. of the 7th Conference on Theory and Applications of Models of Computation (TAMC'10),
LNCS 6108.
Springer,
pp. 397–408,
doi:10.1007/978-3-642-13562-0_36.
T. Sturm & A. Tiwari (2011):
Verification and synthesis using real quantifier elimination.
In: Proc. of the 36th international symposium on Symbolic and algebraic computation (ISSAC'11).
ACM,
pp. 329–336,
doi:10.1145/1993886.1993935.
A. Tarski (1951):
A Decision Method for Elementary Algebra and Geometry.
Univ. California Press.
A. Tiwari & G. Khanna (2002):
Series of Abstractions for Hybrid Automata.
In: Proc. of Hybrid Systems: Computation and Control (HSCC'02),
LNCS 2289.
Springer,
pp. 465–478,
doi:10.1007/3-540-45873-5_36.
eptcs@eptcs.org