Logical analysis of hybrid systems: Proving theorems for complex dynamics

Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics

Volumn , Issue , 2010, Pages 1-426

  Platzer, André ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892257965     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-14509-4     Document Type: Book

References (306)

1. Ábrahám-Mumm, E., Steffen, M., Hannemann, U.: Verification of hybrid systems: Formalization and proof rules in PVS. In: Andler and Offutt [16], pp. 48-57. DOI 10.1109/ICECCS.2001.930163
2. Achatz, M., McCallum, S., Weispfenning, V.: Deciding polynomial- exponential problems. In: J. R. Sendra, L. González-Vega (eds.) ISSAC, pp. 215-222. ACM (2008). DOI 10.1145/1390768.1390799
3. Adams, A., Dunstan, M., Gottliebsen, H., Kelsey, T., Martin, U., Owre, S.: Computer algebra meets automated theorem proving: Integrating Maple and PVS. In: R. J. Boulton, P. B. Jackson (eds.) TPHOLs, LNCS, vol. 2152, pp. 27-42. Springer (2001). DOI 10.1007/3-540-44755-5 4
4. Ahrendt, W., Baar, T., Beckert, B., Bubel, R., Giese, M., Hähnle, R., Menzel, W., Mostowski, W., Roth, A., Schlager, S., Schmitt, P. H.: The KeY tool. Software and System Modeling 4, 32-54 (2005). DOI 10.1007/s10270-004-0058- x
5. Alur, R.: Timed automata. In: N. Halbwachs, D. Peled (eds.) CAV, LNCS, vol. 1633, pp. 8-22. Springer (1999). DOI 10.1007/3-540-48683-6 3
6. Alur, R., Courcoubetis, C., Dill, D. L.: Model-checking for real-time systems. In: Mitchell [210], pp. 414-425
7. Alur, R., Courcoubetis, C., Dill, D. L.: Model-checking in dense real-time. Inf. Comput. 104(1), 2-34 (1993). DOI 10.1006/inco.1993.1024
8. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P. H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138(1), 3-34 (1995). DOI 10.1016/0304-3975 (94) 00202-T
9. Alur, R., Courcoubetis, C., Henzinger, T. A., Ho, P. H.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Grossman et al. [144], pp. 209-229
10. Alur, R., Dill, D. L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183-235 (1994). DOI 10.1016/0304-3975 (94) 90010-8
11. Alur, R., Henzinger, T. A., Ho, P. H.: Automatic symbolic verification of embedded systems. IEEE T. Software Eng. 22(3), 181-201 (1996)
12. Alur, R., Henzinger, T. A., Sontag, E. D. (eds.): Hybrid Systems III: Verification and Control, Proceedings of the DIMACS/SYCON Workshop, October 22-25, 1995, Rutgers University, New Brunswick, NJ, USA, LNCS, vol. 1066. Springer (1996)
13. Alur, R., Henzinger, T. A., Vardi, M. Y.: Parametric real-time reasoning. In: STOC, pp. 592-601 (1993). DOI 10.1145/167088.167242
14. Alur, R., Pappas, G. J. (eds.): Hybrid Systems: Computation and Control, 7th International Workshop, HSCC 2004, Philadelphia, PA, USA, March 25-27, 2004, Proceedings, LNCS, vol. 2993. Springer (2004). DOI 10.1007/b96398
15. Anai, H., Weispfenning, V.: Reach set computations using real quantifier elimination. In: M. D. D. Benedetto, A. L. Sangiovanni-Vincentelli (eds.) HSCC, LNCS, vol. 2034, pp. 63-76. Springer (2001). DOI 10.1007/3-540-45351-2 9
16. Andler, S. F., Offutt, J. (eds.): 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), 11-13 June 2001, Skövde, Sweden. IEEE Computer Society, Los Alamitos (2001)
17. Andrews, P. B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2 edn. Kluwer (2002)
18. Armando, A., Baumgartner, P., Dowek, G. (eds.): Automated Reasoning, Third International Joint Conference, IJCAR 2008, Sydney, Australia, Proceedings, LNCS, vol. 5195. Springer (2008)
19. Arnon, D. S., Collins, G. E., McCallum, S.: Cylindrical algebraic decomposition I: The basic algorithm. SIAM J. Comput. 13(4), 865-877 (1984)
20. Arnon, D. S., Collins, G. E., McCallum, S.: Cylindrical algebraic decomposition II: An adjacency algorithm for the plane. SIAM J. Comput. 13(4), 878-889 (1984)
21. Asarin, E., Dang, T., Girard, A.: Reachability analysis of nonlinear systems using conservative approximation. In: Maler and Pnueli [200], pp. 20-35. DOI 10.1007/3-540-36580-X 5
22. Asarin, E., Dang, T., Maler, O.: The d/dt tool for verification of hybrid systems. In: E. Brinksma, K. G. Larsen (eds.) CAV, LNCS, vol. 2404, pp. 365-370. Springer (2002). DOI 10.1007/3-540-45657-0 30
23. Barnett, M., Chang, B. Y. E., DeLine, R., Jacobs, B., Leino, K. R. M.: Boogie: A modular reusable verifier for object-oriented programs. In: F. S. de Boer, M. M. Bonsangue, S. Graf, W. P. de Roever (eds.) FMCO, LNCS, vol. 4111, pp. 364-387. Springer (2005). DOI 10.1007/11804192 17
24. Basu, S.: New results on quantifier elimination over real closed fields and applications to constraint databases.. J. ACM 46(4), 537-555 (1999). DOI 10.1145/320211.320240
25. Basu, S., Pollack, R., Roy, M. F.: On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43(6), 1002-1045 (1996). DOI 10.1145/235809.235813
26. Basu, S., Pollack, R., Roy, M. F.: Algorithms in Real Algebraic Geometry, 2 edn. Springer (2006)
27. Batt, G., Belta, C., Weiss, R.: Model checking genetic regulatory networks with parameter uncertainty. In: Bemporad et al. [41], pp. 61-75. DOI 10.1007/978-3-540-71493-4 8
28. Bauer, A., Clarke, E. M., Zhao, X.: Analytica-an experiment in combining theorem proving and symbolic computation. J. Autom. Reasoning 21(3), 295-325 (1998). DOI 10.1023/A: 1006079212546
29. Baumgartner, P.: FDPLL - a first order Davis-Putnam-Longeman-Loveland procedure. In: D. A. McAllester (ed.) CADE, LNCS, vol. 1831, pp. 200-219. Springer (2000). DOI 10. 1007/10721959 16
30. Baumgartner, P., Tinelli, C.: The model evolution calculus as a first-order DPLL method. Artif. Intell. 172(4-5), 591-632 (2008). DOI 10.1016/j.artint.2007.09.005
31. Becker, T., Weispfenning, V.: Gröbner Bases, Springer Graduate Texts in Mathematics, vol. 141. Springer (1998)
32. Beckert, B.: Equality and other theories. In: M. D'Agostino, D. Gabbay, R. Hähnle, J. Posegga (eds.) Handbook of Tableau Methods. Kluwer (1999)
33. Beckert, B., Giese, M., Habermalz, E., Hähnle, R., Roth, A., Rümmer, P., Schlager, S.: Taclets: A new paradigm for constructing interactive theorem provers. Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales, Serie A: Matemáticas (RACSAM) 98 (1) (2004)
34. Beckert, B., Giese, M., Hähnle, R., Klebanov, V., Rümmer, P., Schlager, S., Schmitt, P. H.: The KeY System 1.0 (deduction component). In: F. Pfenning (ed.) Proceedings, International Conference on Automated Deduction, Bremen, Germany, LNCS. Springer (2007)
35. Beckert, B., Hähnle, R., Schmitt, P. H. (eds.): Verification of Object-Oriented Software: The KeY Approach, LNCS, vol. 4334. Springer (2007). DOI 10.1007/978-3-540-69061-0
36. Beckert, B., Klebanov, V.: Must program verification systems and calculi be verified? In: 3rd International Verification Workshop VERIFY'06, at FLoC, Seattle, USA, pp. 34-41 (2006)
37. Beckert, B., Platzer, A.: Dynamic logic with non-rigid functions: A basis for object-oriented program verification. In: U. Furbach, N. Shankar (eds.) IJCAR, LNCS, vol. 4130, pp. 266-280. Springer (2006). DOI 10.1007/11814771 23
38. Beckert, B., Schlager, S.: A sequent calculus for first-order dynamic logic with trace modalities. In: Goré et al. [139], pp. 626-641. DOI 10.1007/3-540-45744-5 51
39. van Beek, D. A., Man, K. L., Reniers, M. A., Rooda, J. E., Schiffelers, R. R. H.: Deriving simulators for hybrid Chi models. Intelligent Control, 2006. IEEE International Symposium on pp. 42-49 (2006). DOI 10.1109/CACSD-CCA-ISIC. 2006.4776622
40. van Beek, D. A., Man, K. L., Reniers, M. A., Rooda, J. E., Schiffelers, R. R. H.: Syntax and consistent equation semantics of hybrid Chi. J. Log. Algebr. Program. 68(1-2), 129-210 (2006). DOI 10.1016/j.jlap. 2005.10.005
41. Bemporad, A., Bicchi, A., Buttazzo, G. (eds.): Hybrid Systems: Computation and Control, 10th International Conference, HSCC 2007, Pisa, Italy, Proceedings, LNCS, vol. 4416. Springer (2007)
42. Ben-Ari, M.: Mathematical Logic for Computer Science, 2 edn. Springer (2003)
43. BFU: Investigation report. Tech. Rep. AX001-1-2/02, German Federal Bureau of Aircraft Accidents Investigation (2004)
44. Bianconi, R.: Nondefinability results for expansions of the field of real numbers by the exponential function and by the restricted sine functions.. J. Symb. Log. 62(4), 1173-1178 (1997)
45. Bianconi, R.: Undefinability results in o-minimal expansions of the real numbers. Ann. Pure Appl. Logic 134(1), 43-51 (2005). DOI 10.1016/j.apal.2004.06. 010
46. Bicchi, A., Pallottino, L.: On optimal cooperative conflict resolution for air traffic management systems. IEEE Trans. Intelligent Transportation Systems 1(4), 221-231 (2000)
47. Biere, A., Cimatti, A., Clarke, E. M., Zhu, Y.: Symbolic model checking without BDDs. In: R. Cleaveland (ed.) TACAS, LNCS, vol. 1579, pp. 193-207. Springer (1999). DOI 10.1007/3-540-49059-0 14
48. Blackburn, P.: Internalizing labelled deduction. J. Log. Comput. 10(1), 137-168 (2000)
49. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer, Secaucus, NJ, USA (1998)
50. Bochnak, J., Coste, M., Roy, M. F.: Real Algebraic Geometry, Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 36. Springer (1998)
51. Borchers, B.: CSDP, a C library for semidefinite programming. Optimization Methods and Software 11(1-4), 613-623 (1999). DOI 10.1080/10556789908805765
52. Bourbaki, N.: Algebra I: Chapters 1-3. Elements of mathematics. Springer (1989)
53. Bourbaki, N.: Commutative Algebra. Elements of mathematics. Hermann, Paris (1989). Translated from the French
54. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)
55. Branicky, M. S.: General hybrid dynamical systems: Modeling, analysis, and control. In: Alur et al. [12], pp. 186-200. DOI 10.1007/BFb0020945
56. Branicky, M. S.: Studies in hybrid systems: Modeling, analysis, and control. Ph. D. thesis, Dept. Elec. Eng. and Computer Sci., Massachusetts Inst. Technol., Cambridge, MA (1995)
57. Branicky, M. S.: Universal computation and other capabilities of hybrid and continuous dynamical systems. Theor. Comput. Sci. 138(1), 67-100 (1995). DOI 10.1016/0304-3975 (94) 00147-B
58. Branicky, M. S., Borkar, V. S., Mitter, S. K.: A unified framework for hybrid control: Model and optimal control theory. IEEE T. Automat. Contr. 43(1), 31-45 (1998). DOI 10.1109/9. 654885
59. Brown, C. W.: QEPCAD B: A program for computing with semi-algebraic sets using CADs. SIGSAM Bull. 37(4), 97-108 (2003). DOI 10.1145/968708.968710
60. Brown, C. W., Davenport, J. H.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: D. Wang (ed.) ISSAC, pp. 54-60. ACM (2007). DOI 10.1145/1277548.1277557
61. Bruyèhre, V., Raskin, J. F.: Real-time model-checking: Parameters everywhere. Logical Methods in Computer Science 3 (1) (2007). DOI 10.2168/LMCS-3 (1:7) 2007. Online journal
62. Buchberger, B.: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal.. Ph. D. thesis, University of Innsbruck (1965)
63. Buchberger, B., Jebelean, T., Kriftner, F., Marin, M., Tomuta, E., Vasaru, D.: A survey of the Theorema project. In: ISSAC, pp. 384-391 (1997)
64. Buehler, M.: Summary of DGC 2005 results. Journal of Field Robotics 23, 465-466 (2008). DOI 10.1002/rob.20145
65. Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., Hwang, L. J.: Symbolic model checking: 1020 states and beyond. In: Mitchell [210], pp. 428-439
66. Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., Hwang, L. J.: Symbolic model checking: 1020 states and beyond. Inf. Comput. 98(2), 142-170 (1992). DOI 10.1016/0890-5401 (92) 90017-A
67. Cassez, F., Larsen, K. G.: The impressive power of stopwatches. In: CONCUR, pp. 138-152 (2000). DOI 10.1007/3-540-44618-4 12
68. Caviness, B. F., Johnson, J. R. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation. Springer (1998)
69. Chaochen, Z., Ji, W., Ravn, A. P.: A formal description of hybrid systems. In: Alur et al. [12], pp. 511-530
70. Chutinan, A., Krogh, B. H.: Computational techniques for hybrid system verification. IEEE T. Automat. Contr. 48(1), 64-75 (2003). DOI 10.1109/TAC.2002.806655
71. Cimatti, A., Roveri, M., Tonetta, S.: Requirements validation for hybrid systems. In: A. Bouajjani, O. Maler (eds.) CAV, LNCS, vol. 5643. Springer (2009). DOI 10.1007/978-3-642-02658-4 17
72. Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752-794 (2003). DOI10.1145/876638.876643
73. Clarke, E. M.: Program invariants as fixedpoints. Computing 21(4), 273-294 (1979). DOI10.1007/BF02248730
74. Clarke, E. M., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7-34 (2001)
75. Clarke, E. M., Emerson, E. A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: D. Kozen (ed.) Logic of Programs, LNCS, vol. 131, pp. 52-71. Springer (1981)
76. Clarke, E. M., Emerson, E. A., Sifakis, J.: Model checking: algorithmic verification and debugging. Commun. ACM 52(11), 74-84 (2009). DOI 10.1145/1592761.1592781
77. Clarke, E. M., Fehnker, A., Han, Z., Krogh, B. H., Ouaknine, J., Stursberg, O., Theobald, M.: Abstraction and counterexample-guided refinement in model checking of hybrid systems. Int. J. Found. Comput. Sci. 14(4), 583-604 (2003). DOI 10.1142/S012905410300190X
78. Clarke, E. M., Grumberg, O., Peled, D. A.: Model Checking. MIT Press, Cambridge, MA, USA (1999)
79. Cohen, P. J.: Decision procedures for real and p-adic fields. Communications in Pure and Applied Mathematics 22, 131-151 (1969)
80. Collins, G. E.: Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: H. Barkhage (ed.) Automata Theory and Formal Languages, LNCS, vol. 33, pp. 134-183. Springer (1975). DOI 10.1007/3-540-07407-4 17
81. Collins, G. E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput. 12(3), 299-328 (1991). DOI 10.1016/S0747-7171 (08) 80152-6
82. Collins, G. E., Johnson, J. R.: Quantifier elimination and the sign variation method for real root isolation. In: ISSAC, pp. 264-271 (1989). DOI 10.1145/74540.74574
83. Collins, G. E., Johnson, J. R., Krandick, W.: Interval arithmetic in cylindrical algebraic decomposition. J. Symb. Comput. 34(2), 145-157 (2002). DOI 10.1006/jsco.2002.0547
84. Collins, G. E., Johnson, J. R., Küchlin, W.: Parallel real root isolation using the coefficient sign variation method. In: R. Zippel (ed.) CAP, LNCS, vol. 584, pp. 71-87. Springer (1990)
85. Collins, P., Lygeros, J.: Computability of finite-time reachable sets for hybrid systems. In: CDC-ECC'05, pp. 4688-4693. IEEE (2005)
86. Comon, H., Jurski, Y.: Timed automata and the theory of real numbers. In: J. C. M. Baeten, S. Mauw (eds.) CONCUR, LNCS, vol. 1664, pp. 242-257. Springer (1999). DOI 10.1007/3-540-48320-9 18
87. Cook, S. A.: Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7(1), 70-90 (1978). DOI 10.1137/0207005
88. Cox, D. A., Little, J., O'Shea, D.: Ideals, Varieties and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra.. Undergraduate Texts in Mathematics. Springer, New York (1992)
89. Damm, W., Hungar, H., Olderog, E. R.: On the verification of cooperating traffic agents. In: F. S. de Boer, M. M. Bonsangue, S. Graf, W. P. de Roever (eds.) FMCO, LNCS, vol. 3188, pp. 77-110. Springer (2003). DOI 10.1007/b100112
90. Damm, W., Hungar, H., Olderog, E. R.: Verification of cooperating traffic agents. International Journal of Control 79(5), 395-421 (2006). DOI 10.1080/00207170600587531
91. Damm, W., Mikschl, A., Oehlerking, J., Olderog, E. R., Pang, J., Platzer, A., Segelken, M., Wirtz, B.: Automating verification of cooperation, control, and design in traffic applications. In: C. B. Jones, Z. Liu, J. Woodcock (eds.) Formal Methods and Hybrid Real-Time Systems, LNCS, vol. 4700, pp. 115-169. Springer (2007). DOI 10.1007/978-3-540-75221-9 6
92. Damm, W., Pinto, G., Ratschan, S.: Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems. In: Peled and Tsay [226], pp. 99-113. DOI 10.1007/11562948 10
93. Dantzig, G. B., Eaves, B. C.: Fourier-Motzkin elimination and its dual. J. Comb. Theory, Ser. A 14(3), 288-297 (1973)
94. Davenport, J. H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1/2), 29-35 (1988). DOI 10.1016/S0747-7171 (88) 80004-X
95. Davoren, J. M.: On hybrid systems and the modal m-calculus. In: P. J. Antsaklis, W. Kohn, M. D. Lemmon, A. Nerode, S. Sastry (eds.) Hybrid Systems, LNCS, vol. 1567, pp. 38-69. Springer (1997). DOI 10.1007/3-540-49163-5 3
96. Davoren, J. M., Coulthard, V., Markey, N., Moor, T.: Non-deterministic temporal logics for general flow systems. In: Alur and Pappas [14], pp. 280-295. DOI 10.1007/b96398
97. Davoren, J. M., Nerode, A.: Logics for hybrid systems. IEEE 88(7), 985-1010 (2000). DOI10.1109/5.871305
98. Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool KRONOS. In: Hybrid Systems III, LNCS, vol. 1066, pp. 208-219 (1996)
99. Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM 22(8), 465-476 (1979). DOI 10.1145/359138.359142
100. Deshpande, A., Göllü, A., Varaiya, P.: SHIFT: A formalism and a programming language for dynamic networks of hybrid automata. In: P. J. Antsaklis, W. Kohn, A. Nerode, S. Sastry (eds.) Hybrid Systems, LNCS, vol. 1273, pp. 113-133. Springer (1996). DOI10.1007/BFb0031558
101. Dolzmann, A., Sturm, T.: Redlog: Computer algebra meets computer logic. ACM SIGSAM Bull. 31, 2-9 (1997). DOI 10.1145/261320.261324
102. Donzé, A., Maler, O.: Systematic simulation using sensitivity analysis. In: Bemporad et al. [41], pp. 174-189. DOI 10.1007/978-3-540-71493-4 16
103. Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. J. Autom. Reasoning 31(1), 33-72 (2003). DOI 10.1023/A:1027357912519
104. Dowek, G., Muñoz, C., Carreño, V. A.: Provably safe coordinated strategy for distributed conflict resolution. In: Proceedings of the AIAA Guidance Navigation, and Control Conference and Exhibit 2005, AIAA-2005-6047 (2005)
105. van den Dries, L.: Alfred Tarski's elimination theory for real closed fields. J. Symb. Log. 53(1), 7-19 (1988)
106. van den Dries, L.: Tame Topology and O-minimal Structures. Cambridge University Press (1998)
107. van den Dries, L., Miller, C.: On the real exponential field with restricted analytic functions. Israel J. Math. 85(1-3), 19-56 (1994). DOI 10.1007/BF02758635
108. van den Dries, L., Speissegger, P.: The real field with convergent generalized power series. Trans. Amer. Math. Soc. 350, 4377-4421 (1998). DOI 10.1090/S0002-9947-98-02105-9
109. Dubois, D. W.: A Nullstellensatz for ordered fields. Ark. Mat. 8(2), 111-114 (1970). DOI10.1007/BF02589551
110. Egerstedt, M., Johansson, K. H., Sastry, S., Lygeros, J.: On the regularization of Zeno hybrid automata. Systems and Control Letters 38, 141-150 (1999)
111. Egerstedt, M., Mishra, B. (eds.): Hybrid Systems: Computation and Control, 11th International Conference, HSCC 2008, St. Louis, MO, USA, Proceedings, LNCS, vol. 4981. Springer (2008)
112. Eisenbud, D.: Commutative algebra with a view toward algebraic geometry, Graduate Texts in Mathematics, vol. 150, 3edn. Springer, New York (1999)
113. Emerson, A.: Temporal and modal logic. In: J. van Leeuwen (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 995-1072. MIT Press (1990)
114. Emerson, E. A., Clarke, E. M.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2(3), 241-266 (1982)
115. Emerson, E. A., Halpern, J. Y.: "Sometimes" and "Not Never" revisited: on branching versus linear time temporal logic. J. ACM 33(1), 151-178 (1986). DOI 10.1145/4904.4999
116. Eriksson, K., Estep, D., Hansbo, P., Johnson, C.: Computational Differential Equations. Cambridge University Press (1996)
117. ERTMS User Group: ERTMS/ETCS System requirements specification. http://www.era.europa.eu (2002)
118. Etessami, K., Rajamani, S. K. (eds.): Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings, LNCS, vol. 3576. Springer (2005)
119. Faber, J., Meyer, R.: Model checking data-dependent real-time properties of the European Train Control System. In: FMCAD, pp. 76-77. IEEE Computer Society Press (2006). DOI10.1109/FMCAD.2006.21
120. Faugére, J. C.: A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra 139(1-3), 61-88 (1999). DOI 10.1016/S0022-4049 (99) 00005-5
121. Faugére, J. C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In: ISAAC. ACM Press (2002). DOI 10.1145/780506.780516
122. Fitting, M.: First-Order Logic and Automated Theorem Proving, 2 edn. Springer, New York (1996)
123. Fitting, M., Mendelsohn, R. L.: First-OrderModal Logic. Kluwer, Norwell, MA, USA (1999)
124. Fourier, J. B. J.: Solution d'une question particulière du calcul des inégalités. Nouveau Bulletin des Sciences par la Société Philomatique de Paris pp. 99-100 (1823)
125. Fränzle, M.: Analysis of hybrid systems: An ounce of realism can save an infinity of states. In: J. Flum, M. Rodríguez-Artalejo (eds.) CSL, LNCS, vol. 1683, pp. 126-140. Springer (1999)
126. Frehse, G.: PHAVer: Algorithmic verification of hybrid systems past HyTech. In: Morari and Thiele [212], pp. 258-273. DOI 10.1007/b106766
127. Frehse, G.: PHAVer: algorithmic verification of hybrid systems past HyTech. STTT 10(3), 263-279 (2008). DOI 10.1007/s10009-007-0062-x
128. Frehse, G., Jha, S. K., Krogh, B. H.: A counterexample-guided approach to parameter synthesis for linear hybrid automata. In: Egerstedt and Mishra [111], pp. 187-200. DOI10.1007/978-3-540-78929-1 14
129. Galdino, A. L., Muñoz, C., Ayala-Rincón, M.: Formal verification of an optimal air traffic conflict resolution and recovery algorithm. In: D. Leivant, R. de Queiroz (eds.) WoLLIC, LNCS, vol. 4576, pp. 177-188. Springer (2007)
130. Gallier, J. H.: Logic for Computer Science. Longman Higher Education (1986)
131. Ganzinger, H., Korovin, K.: Theory instantiation. In: M. Hermann, A. Voronkov (eds.) LPAR, LNCS, vol. 4246, pp. 497-511. Springer (2006). DOI 10.1007/11916277 34
132. Gear, C. W.: Differential-algebraic equations index transformations. SIAM J. Sci. Stat. Comput. 9(1), 39-47 (1988). DOI 10.1137/0909004
133. Gentzen, G.: Untersuchungen über das logische Schließen. Math. Zeit. 39, 405-431 (1935). DOI 10.1007/BF01201363
134. Giese, M.: Incremental closure of free variable tableaux. In: Goré et al. [139], pp. 545-560. DOI 10.1007/3-540-45744-5 46
135. Gödel, K.: Über die Vollständigkeit des Logikkalküls. Ph. D. thesis, UniversitätWien (1929)
136. Gödel, K.: Die Vollständigkeit der Axiome des logischen Funktionenkalküls. Mon. hefte Math. Phys. 37, 349-360 (1930). DOI 10.1007/BF01696781
137. Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Mon. hefte Math. Phys. 38, 173-198 (1931). DOI 10.1007/BF01700692
138. Gordon, M. J. C., Melham, T. F.: Introduction to HOL: A Theorem-Proving Environment for Higher-Order Logic. Cambridge Univ. Press (1993)
139. Goré, R., Leitsch, A., Nipkow, T. (eds.): Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings, LNCS, vol. 2083. Springer (2001)
140. Graça, D. S., Campagnolo, M. L., Buescu, J.: Computability with polynomial differential equations. Advances in Applied Mathematics (2007)
141. Grigoriev, D.: Complexity of deciding Tarski algebra. J. Symb. Comput. 5(1/2), 65-108 (1988). DOI 10.1016/S0747-7171 (88) 80006-3
142. Grigoriev, D., Vorobjov, N.: Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5(1/2), 37-64 (1988). DOI 10.1016/S0747-7171 (88) 80005-1
143. Gross, J.: Schlussbericht über die Entgleisung von Güterzug 43647 der BLS AG auf der Weiche 34 (Einfahrt Lötschberg-Basisstrecke).. Tech. Rep. 07101601, Unfalluntersuchungsstelle Bahnen und Schiffe (2007)
144. Grossman, R. L., Nerode, A., Ravn, A. P., Rischel, H. (eds.): Hybrid Systems, LNCS, vol. 736. Springer (1993)
145. Gulwani, S., Tiwari, A.: Constraint-based approach for analysis of hybrid systems. In: Gupta and Malik [146], pp. 190-203. DOI 10.1007/978-3-540-70545-1
146. Gupta, A., Malik, S. (eds.): Computer Aided Verification, CAV 2008, Princeton, NJ, USA, Proceedings, LNCS, vol. 5123. Springer (2008)
147. Hähnle, R., Schmitt, P. H.: The liberalized d-rule in free variable semantic tableaux. J. Autom. Reasoning 13(2), 211-221 (1994). DOI 10.1007/BF00881956
148. Harel, D.: First-Order Dynamic Logic. Springer, New York (1979)
149. Harel, D., Kozen, D., Tiuryn, J.: Dynamic logic. MIT Press, Cambridge (2000)
150. Harris, J.: Algebraic Geometry: A First Course. Graduate Texts in Mathematics. Springer (1995)
151. Harrison, J.: Verifying nonlinear real formulas via sums of squares. In: K. Schneider, J. Brandt (eds.) TPHOLs, LNCS, vol. 4732, pp. 102-118. Springer (2007). DOI 10.1007/978-3-540-74591-4 9
152. Harrison, J.: Handbook of Practical Logic and Automated Reasoning. Cambridge Univ. Press (2009)
153. Hartman, P.: Ordinary Differential Equations. John Wiley (1964)
154. Hartshorne, R.: Algebraic Geometry, Graduate Texts in Mathematics, vol. 52. Springer (1977)
155. Henkin, L.: The completeness of the first-order functional calculus. J. Symb. Log. 14(3), 159-166 (1949)
156. Henzinger, T. A.: The theory of hybrid automata. In: LICS, pp. 278-292. IEEE Computer Society, Los Alamitos (1996)
157. Henzinger, T. A., Ho, P. H.: HYTECH: The Cornell HYbrid TECHnology tools. In: P. J. Antsaklis, W. Kohn, A. Nerode, S. Sastry (eds.) Hybrid Systems, LNCS, vol. 999, pp. 265-293. Springer (1994)
158. Henzinger, T. A., Ho, P. H., Wong-Toi, H.: HyTech: A model checker for hybrid systems. In: O. Grumberg (ed.) CAV, LNCS, vol. 1254, pp. 460-463. Springer (1997)
159. Henzinger, T. A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. In: LICS, pp. 394-406. IEEE Computer Society (1992). DOI 10.1006/inco.1994. 1045
160. Herbrand, J.: Recherches sur la théorie de la dé monstration. Travaux de la Société des Sciences et des Lettres de Varsovie, Class III, Sciences Mathématiques et Physiques 33, 33-160 (1930)
161. Hoare, C. A. R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576-580 (1969). DOI 10.1145/363235.363259
162. Hoare, C. A. R.: Communicating Sequential Processes. Prentice Hall International (1985)
163. Hodges, W.: Model Theory. Cambridge University Press (1993)
164. Hoffmann, G. M., Huang, H., Waslander, S. L., Tomlin, C. J.: Quadrotor helicopter flight dynamics and control: Theory and experiment. In: Proceedings of the AIAA Guidance, Navigation, and Control Conference. Hilton Head, SC (2007). AIAA Paper Number 2007-6461
165. Hörmander, L.: The Analysis of Linear Partial Differential Operators II, Grundlehren der mathematischen Wissenschaften, vol. 257. Springer (1983)
166. Hsu, A., Eskafi, F., Sachs, S., Varaiya, P.: Design of platoon maneuver protocols for IVHS. PATH Research Report UCB-ITS-PRR-91-6, Institute of Transportation Studies, University of California, Berkeley (1991)
167. Hu, J., Prandini, M., Sastry, S.: Optimal coordinated motions of multiple agents moving on a plane. SIAM Journal on Control and Optimization 42, 637-668 (2003)
168. Hu, J., Prandini, M., Sastry, S.: Probabilistic safety analysis in three-dimensional aircraft flight. In: CDC, vol. 5, pp. 5335-5340 (2003). DOI 10.1109/CDC.2003.1272485
169. Huth, M., Ryan, M.: Logic in Computer Science: Modelling and Reasoning about Systems, 2 edn. Cambridge Univ. Press (2004)
170. Hutter, D., Langenstein, B., Sengler, C., Siekmann, J. H., Stephan, W., Wolpers, A.: Deduction in the verification support environment (VSE). In: M. C. Gaudel, J. Woodcock (eds.) FME, LNCS, vol. 1051, pp. 268-286. Springer (1996)
171. Hwang, I., Kim, J., Tomlin, C.: Protocol-based conflict resolution for air traffic control. Air Traffic Control Quarterly 15(1), 1-34 (2007)
172. Ilyashenko, Y., Yakovenko, S.: Lectures on Analytic Differential Equations, Graduate Studies in Mathematics, vol. 86. AMS (2008)
173. Jhala, R., McMillan, K. L.: Interpolant-based transition relation approximation. In: Etessami and Rajamani [118], pp. 39-51. DOI 10.1007/115139886
174. Jhala, R., McMillan, K. L.: Interpolant-based transition relation approximation. Logical Methods in Computer Science 3 (4) (2007). DOI 10.2168/LMCS-3 (4:1) 2007
175. Jifeng, H.: From CSP to hybrid systems. In: A. W. Roscoe (ed.) A classical mind: essays in honour of C. A. R. Hoare, pp. 171-189. Prentice Hall, Hertfordshire, UK (1994)
176. Johansson, K. H., Sastry, S., Zhang, J., Lygeros, J.: Zeno hybrid systems. Int. J. Robust and Nonlinear Control 11, 435-451 (2001). DOI 10.1002/rnc.592
177. Katok, A., Hasselblatt, B.: Introduction to the Modern Theory of Dynamical Systems. Cambridge University Press, New York, NY (1996)
178. Kesten, Y., Manna, Z., Pnueli, A.: Verification of clocked and hybrid systems. Acta Inf. 36(11), 837-912 (2000). DOI 10.1007/s002360050177
179. Kolchin, E. R.: Differential Algebra and Algebraic Groups. Academic Press, New York (1972)
180. Košecká, J., Tomlin, C., Pappas, G., Sastry, S.: 2-1/2D conflict resolution maneuvers for ATMS. In: CDC, vol. 3, pp. 2650-2655. Tampa, FL, USA (1998). DOI 10.1109/CDC.1998. 757853
181. Kozen, D.: Results on the propositional m-calculus. Theor. Comput. Sci. 27, 333-354 (1983). DOI 10.1016/0304-3975 (82) 90125-6
182. Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427-443 (1997). DOI 10.1145/256167.256195
183. Kratz, F., Sokolsky, O., Pappas, G. J., Lee, I.: R-Charon, a modeling language for reconfigurable hybrid systems. In: J. P. Hespanha, A. Tiwari (eds.) HSCC, LNCS, vol. 3927, pp. 392-406. Springer (2006). DOI 10.1007/11730637 30
184. Kreisel, G., Krivine, J. L.: Elements of mathematical logic: Model Theory, 2 edn. North-Holland (1971)
185. Kripke, S. A.: Semantical considerations on modal logic. Acta Philosophica Fennica 16, 83-94 (1963)
186. Krivine, J. L.: Anneaux préordonnés. Journal d'analyse mathématique 12, 307-326 (1964)
187. Kunkel, P., Mehrmann, V.: Differential-Algebraic Equations: Analysis and Numerical Solution. European Mathematical Society (2006)
188. Lafferriere, G., Pappas, G. J., Sastry, S.: O-minimal hybrid systems. Mathematics of Control, Signals, and Systems 13(1), 1-21 (2000). DOI 10.1007/PL00009858
189. Lafferriere, G., Pappas, G. J., Yovine, S.: A new class of decidable hybrid systems. In: F. W. Vaandrager, J. H. van Schuppen (eds.) HSCC, LNCS, vol. 1569, pp. 137-151. Springer (1999). DOI 10.1007/3-540-48983-5 15
190. Lafferriere, G., Pappas, G. J., Yovine, S.: Symbolic reachability computation for families of linear vector fields. J. Symb. Comput. 32(3), 231-253 (2001). DOI 10.1006/jsco.2001.0472
191. Lang, S.: Algebra. Addison-Wesley Publishing Company (1978)
192. Lanotte, R., Tini, S.: Taylor approximation for hybrid systems. In: Morari and Thiele [212], pp. 402-416. DOI 10.1007/b106766
193. Larsen, K. G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. STTT 1(1-2), 134-152 (1997)
194. Liberzon, D.: Switching in Systems and Control. Systems and Control: Foundations and Applications. Birkhäuser, Boston, MA (2003)
195. Lindelöf, M. E.: Sur l'application de la méthode des approximations successives aux équations différentielles ordinaires du premier ordre.. Comptes rendus hebdomadaires des séances de l'Académie des sciences 114, 454-457 (1894)
196. Livadas, C., Lygeros, J., Lynch, N. A.: High-level modeling and analysis of TCAS. Proc. IEEE - Special Issue on Hybrid Systems: Theory & Applications 88(7), 926-947 (2000)
197. Łojasiewicz, S.: Triangulations of semi-analytic sets. Annali della Scuola Normale Superiore di Pisa 18, 449-474 (1964)
198. Loos, R., Weispfenning, V.: Applying linear quantifier elimination. Comput. J. 36(5), 450-462 (1993). DOI 10.1093/comjnl/36.5.450
199. Löwenheim, L.: ÜberMöglichkeiten im Relativkalkül. Mathematische Annalen 76, 447-470 (1915). DOI 10.1007/BF01458217
200. Maler, O., Pnueli, A. (eds.): Hybrid Systems: Computation and Control, 6th International Workshop, HSCC 2003 Prague, Czech Republic, April 3-5, 2003, Proceedings, LNCS, vol. 2623. Springer (2003)
201. Manna, Z., Sipma, H.: Deductive verification of hybrid systems using STeP. In: T. A. Henzinger, S. Sastry (eds.) HSCC, LNCS, vol. 1386, pp. 305-318. Springer (1998). DOI10.1007/3-540-64358-3 47
202. Mansfield, E. L.: Differential Gröbner bases. Ph. D. thesis, University of Sydney (1991)
203. Massink, M., Francesco, N. D.: Modelling free flight with collision avoidance. In: Andler and Offutt [16], pp. 270-280. DOI 10.1109/ICECCS.2001. 930186
204. McLaughlin, S., Harrison, J.: A proof-producing decision procedure for real arithmetic. In: R. Nieuwenhuis (ed.) CADE, LNCS, vol. 3632, pp. 295-314. Springer (2005). DOI 10.1007/11532231 22
205. Meyer, R., Faber, J., Hoenicke, J., Rybalchenko, A.: Model checking duration calculus: A practical approach. Formal Aspects of Computing pp. 1-25 (2008). DOI 10.1007/s00165-008-0082-7
206. Miller, C. L.: Expansions of the real field with power functions. Ann. Pure Appl. Logic 68(1), 79-94 (1994)
207. Milner, R.: Logic for computable functions: description of a machine implementation. Tech. rep., Stanford University, Stanford, CA, USA (1972)
208. Milner, R.: Communicating and Mobile Systems: the p-Calculus. Cambridge Univ. Press (1999)
209. Misner, C. W., Thorne, K. S., Wheeler, J. A.: Gravitation. W. H. Freeman, New York (1973)
210. Mitchell, J. (ed.): Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, 4-7 June 1990, Philadelphia, Pennsylvania, USA. IEEE Computer Society (1990)
211. Mora, T.: Solving Polynomial Equation Systems II: Macaulay's Paradigm and Gröbner Technology. Cambridge University Press (2005)
212. Morari, M., Thiele, L. (eds.): Hybrid Systems: Computation and Control, 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings, LNCS, vol. 3414. Springer (2005)
213. Morayne, M.: On differentiability of Peano type functions. Colloquium Mathematicum LIII, 129-132 (1987)
214. Motzkin, T. S.: Beiträge zur Theorie der Linearen Ungleichungen. Ph. D. thesis, Basel, Jerusalem (1936)
215. Mumford, D.: Algebraic Geometry I: Complex Projective Varieties. Classics in Mathematics. Springer (1995)
216. Muñoz, C., Carreño, V., Dowek, G., Butler, R. W.: Formal verification of conflict detection algorithms. STTT 4(3), 371-380 (2003). DOI 10.1007/s10009-002-0084-3
217. Mysore, V., Piazza, C., Mishra, B.: Algorithmic algebraic model checking II: Decidability of semi-algebraic model checking and its applications to systems biology. In: Peled and Tsay [226], pp. 217-233. DOI 10.1007/11562948 18
218. Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: An approach to the description and analysis of hybrid systems. In: Grossman et al. [144], pp. 149-178
219. Nipkow, T.: Linear quantifier elimination. In: Armando et al. [18]
220. Nipkow, T., Paulson, L. C., Wenzel, M.: Isabelle/HOL-A Proof Assistant for Higher-Order Logic, LNCS, vol. 2283. Springer (2002)
221. Olderog, E. R., Dierks, H.: Real-Time Systems: Formal Specification and Automatic Verification. Cambridge Univ. Press (2008)
222. Pallottino, L., Scordio, V. G., Frazzoli, E., Bicchi, A.: Decentralized cooperative policy for conflict resolution in multi-vehicle systems. IEEE Trans. on Robotics 23(6), 1170-1183 (2007)
223. Parker, R. S., Doyle, F. J., Peppas, N. A.: The intravenous route to blood glucose control. IEEE Engineering in Medicine and Biology 20(1), 65-73 (2001). DOI 10.1109/51.897829
224. Parrilo, P. A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293-320 (2003). DOI 10.1007/s10107-003-0387-5
225. Peano, G.: Demonstration de l'intégrabilité des équations différentielles ordinaires. Mathematische Annalen 37(2), 182-228 (1890). DOI 10.1007/BF01200235
226. Peled, D., Tsay, Y. K. (eds.): Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings, LNCS, vol. 3707. Springer (2005)
227. Perko, L.: Differential equations and dynamical systems, 3edn. Springer, New York, NY, USA (2006)
228. Piazza, C., Antoniotti, M., Mysore, V., Policriti, A., Winkler, F., Mishra, B.: Algorithmic algebraic model checking I: Challenges from systems biology. In: Etessami and Rajamani [118], pp. 5-19. DOI 10.1007/115139883
229. Plaisted, D. A., Zhu, Y.: Ordered semantic hyper-linking. J. Autom. Reasoning 25(3), 167-217 (2000)
230. Platzer, A.: Combining deduction and algebraic constraints for hybrid system analysis. In: B. Beckert (ed.) VERIFY'07 at CADE, Bremen, Germany, CEUR Workshop Proceedings, vol. 259, pp. 164-178. CEUR-WS.org (2007)
231. Platzer, A.: Differential dynamic logic for verifying parametric hybrid systems. In: N. Olivetti (ed.) TABLEAUX, LNCS, vol. 4548, pp. 216-232. Springer (2007). DOI 10.1007/978-3-540-73099-6 17
232. Platzer, A.: Differential logic for reasoning about hybrid systems. In: Bemporad et al. [41], pp. 746-749. DOI 10.1007/978-3-540-71493-4 75
233. Platzer, A.: A temporal dynamic logic for verifying hybrid system invariants. In: S. N. Artëmov, A. Nerode (eds.) LFCS, LNCS, vol. 4514, pp. 457-471. Springer (2007). DOI10.1007/978-3-540-72734-7 32
234. Platzer, A.: Towards a hybrid dynamic logic for hybrid dynamic systems. In: P. Blackburn, T. Bolander, T. Braüner, V. de Paiva, J. Villadsen (eds.) LICS International Workshop on Hybrid Logic, HyLo'06, Seattle, USA, Proceedings, ENTCS, vol. 174, pp. 63-77 (2007). DOI 10.1016/j.entcs.2006.11.026
235. Platzer, A.: Differential dynamic logic for hybrid systems. Journal of Automated Reasoning 41(2), 143-189 (2008). DOI 10.1007/s10817-008-9103-8
236. Platzer, A.: Differential dynamic logics: Automated theorem proving for hybrid systems. Ph. D. thesis, Department of Computing Science, University of Oldenburg (2008)
237. Platzer, A.: Differential-algebraic dynamic logic for differential-algebraic programs. Journal of Logic and Computation 20(1), 309-352 (2010). DOI 10.1093/logcom/exn070. Advance Access published on November 18, 2008
238. Platzer, A., Clarke, E. M.: The image computation problem in hybrid systems model checking. In: Bemporad et al. [41], pp. 473-486. DOI 10.1007/978-3-540-71493-4 37
239. Platzer, A., Clarke, E. M.: Computing differential invariants of hybrid systems as fixedpoints. In: Gupta and Malik [146], pp. 176-189. DOI 10.1007/978-3-540-70545-1 17
240. Platzer, A., Clarke, E. M.: Computing differential invariants of hybrid systems as fixedpoints. Formal Methods in System Design 35(1), 98-120 (2009). DOI 10.1007/s10703-009-0079-8
241. Platzer, A., Clarke, E. M.: Formal verification of curved flight collision avoidance maneuvers: A case study. In: A. Cavalcanti, D. Dams (eds.) FM, LNCS, vol. 5850, pp. 547-562. Springer (2009). DOI 10.1007/978-3-642-05089-3 35
242. Platzer, A., Quesel, J. D.: KeYmaera: A hybrid theorem prover for hybrid systems. In: Armando et al. [18], pp. 171-178. DOI 10.1007/978-3-540-71070-7 15
243. Platzer, A., Quesel, J. D.: Logical verification and systematic parametric analysis in train control. In: Egerstedt and Mishra [111], pp. 646-649. DOI 10.1007/978-3-540-78929-1 55
244. Platzer, A., Quesel, J. D.: European Train Control System: A case study in formal verification. In: K. Breitman, A. Cavalcanti (eds.) ICFEM, LNCS, vol. 5885, pp. 246-265. Springer (2009). DOI 10.1007/978-3-642-10373-5 13
245. Platzer, A., Quesel, J. D.: European Train Control System: A case study in formal verification. Tech. Rep. 54, Reports of SFB/TR 14 AVACS (2009). ISSN: 1860-9821, http://www.avacs.org.
246. Platzer, A., Quesel, J. D., Rümmer, P.: Real world verification. In: R. A. Schmidt (ed.) CADE, LNCS, vol. 5663, pp. 485-501. Springer (2009). DOI 10.1007/978-3-642-02959-2 35
247. Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46-57. IEEE (1977)
248. Pnueli, A., Kesten, Y.: A deductive proof system for CTL*. In: L. Brim, P. Jancar, M. Kretínský, A. Kucera (eds.) CONCUR, LNCS, vol. 2421, pp. 24-40. Springer (2002). DOI 10.1007/3-540-45694-5 2
249. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179-190 (1989). DOI 10.1145/75277.75293
250. Pour-El, M. B., Richards, I.: A computable ordinary differential equation which possesses no computable solution. Annals of Mathematical Logic 17, 61-90 (1979). DOI 10.1016/0003-4843 (79) 90021-4
251. Prajna, S., Jadbabaie, A.: Safety verification of hybrid systems using barrier certificates. In: Alur and Pappas [14], pp. 477-492. DOI 10.1007/b96398
252. Prajna, S., Jadbabaie, A., Pappas, G. J.: A framework for worst-case and stochastic safety verification using barrier certificates. IEEE T. Automat. Contr. 52(8), 1415-1429 (2007). DOI 10.1109/TAC.2007.902736
253. Pratt, V. R.: Semantical considerations on Floyd-Hoare logic. In: FOCS, pp. 109-121. IEEE (1976)
254. Pratt, V. R.: Process logic. In: POPL, pp. 93-100 (1979). DOI 10.1145/567752.567761
255. Queille, J. P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: M. Dezani-Ciancaglini, U. Montanari (eds.) Symposium on Programming, LNCS, vol. 137, pp. 337-351. Springer (1982). DOI 10.1007/3-540-11494-7 22
256. Quesel, J. D.: A theorem prover for differential dynamic logic. Master's thesis, University of Oldenburg, Department of Computing Science. Correct System Design Group (2007)
257. Reid, W. T.: Ordinary Differential Equations. John Wiley (1971)
258. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part I: Introduction.. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. J. Symb. Comput. 13(3), 255-300 (1992)
259. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part II: The general decision problem.. Preliminaries for quantifier elimination. J. Symb. Comput. 13(3), 301-328 (1992)
260. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part III: Quantifier elimination.. J. Symb. Comput. 13(3), 329-352 (1992)
261. Reynolds, M.: An axiomatization of PCTL*. Inf. Comput. 201(1), 72-119 (2005). DOI10.1016/j.ic.2005.03.005
262. Risler, J. J.: Une caractérisation des idéaux des variétés algébraiques réelles. C. R. A. S. Paris série A 271, 1171-1173 (1970)
263. Risler, J. J.: Some aspects of complexity in real algebraic geometry. J. Symb. Comput. 5(1/2), 109-119 (1988). DOI 10.1016/S0747-7171 (88) 80007-5
264. Robinson, A.: Complete Theories. North-Holland (1956)
265. Robinson, J. A.: A machine-oriented logic based on the resolution principle. J. Assoc. Comput. Mach. 12, 23-41 (1965). DOI 10.1145/321250.321253
266. Rodríguez-Carbonell, E., Kapur, D.: An abstract interpretation approach for automatic generation of polynomial invariants. In: R. Giacobazzi (ed.) SAS, Lecture Notes in Computer Science, vol. 3148, pp. 280-295. Springer (2004). DOI 10.1007/b99688
267. Rodríguez-Carbonell, E., Kapur, D.: Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Sci. Comput. Program. 64(1), 54-75 (2007). DOI 10.1016/j.scico.2006.03.003
268. Rodríguez-Carbonell, E., Kapur, D.: Generating all polynomial invariants in simple loops. J. Symb. Comput. 42(4), 443-476 (2007). DOI 10.1016/j.jsc.2007.01.002
269. Rodríguez-Carbonell, E., Tiwari, A.: Generating polynomial invariants for hybrid systems. In: Morari and Thiele [212], pp. 590-605. DOI 10.1007/b106766
270. Rönkkö, M., Ravn, A. P., Sere, K.: Hybrid action systems. Theor. Comput. Sci. 290(1), 937-973 (2003)
271. Rounds, W. C.: A spatial logic for the hybrid p-calculus. In: Alur and Pappas [14], pp. 508-522. DOI 10.1007/b96398
272. Rounds, W. C., Song, H.: The f-calculus: A language for distributed control of reconfigurable embedded systems. In: HSCC, LNCS, vol. 2623, pp. 435-449 (2003). DOI10.1007/3-540-36580-X 32
273. Rümmer, P.: A sequent calculus for integer arithmetic with counterexample generation. In: B. Beckert (ed.) VERIFY'07 at CADE, Bremen, Germany, CEUR Workshop Proceedings, vol. 259, pp. 179-194. CEUR-WS.org (2007)
274. Sankaranarayanan, S., Sipma, H., Manna, Z.: Constructing invariants for hybrid systems. In: Alur and Pappas [14], pp. 539-554. DOI 10.1007/b96398
275. Schobbens, P. Y., Raskin, J. F., Henzinger, T. A.: Axioms for real-time logics. Theor. Comput. Sci. 274(1-2), 151-182 (2002). DOI 10.1016/S0304-3975 (00) 00308-X
276. Schrödinger, E.: An undulatory theory of the mechanics of atoms and molecules. Phys. Rev. 28, 1049-1070 (1926). DOI 10.1103/PhysRev. 28.1049
277. Scott, D., Strachey, C.: Toward a mathematical semantics for computer languages? Tech. Rep. PRG-6, Oxford Programming Research Group (1971)
278. Seidenberg, A.: A new decision method for elementary algebra. Annals of Mathematics 60, 365-374 (1954)
279. Sibirsky, K. S.: Introduction to Topological Dynamics. Noordhoff, Leyden (1975)
280. Sipser, M.: Introduction to the Theory of Computation, 2 edn. Course Technology (2005)
281. Skolem, T.: Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theorem über dichte Mengen.. Videnskapsselskapet Skrifter, I. Matematisk-naturvidenskabelig Klasse 6, 1-36 (1920)
282. Smullyan, R. M.: First-Order Logic. Dover (1995)
283. Stengle, G.: A Nullstellensatz and a Positivstellensatz in semialgebraic geometry. Math. Ann. 207(2), 87-97 (1973). DOI 10.1007/BF01362149
284. Stirling, C.: Modal and temporal logics. In: Handbook of Logic in Computer Science (vol. 2): Background: Computational Structures, pp. 477-563. Oxford University Press, Inc., New York, NY, USA (1992)
285. Strzebonski, A. W.: Cylindrical algebraic decomposition using validated numerics. J. Symb. Comput. 41(9), 1021-1038 (2006). DOI 10.1016/j.jsc.2006.06. 004
286. Sturm, C. F.: Mémoire sur la résolution des équations numériques. Mémoires des Savants Etrangers 6, 271-318 (1835)
287. Tarski, A.: Sur les ensembles définissables de nombres réels I. Fundam. Math. 17, 210-239 (1931)
288. Tarski, A.: A Decision Method for Elementary Algebra and Geometry, 2 edn. University of California Press, Berkeley (1951)
289. Tavernini, L.: Differential automata and their discrete simulators. Non-Linear Anal. 11(6), 665-683 (1987). DOI 10.1016/0362-546X (87) 90034-4
290. Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing. J. Autom. Reasoning 30(1), 1-31 (2003). DOI 10.1023/A:1022587501759
291. Tiwari, A.: Approximate reachability for linear systems. In: Maler and Pnueli [200], pp. 514-525. DOI 10.1007/3-540-36580-X 37
292. Tiwari, A.: An algebraic approach for the unsatisfiability of nonlinear constraints. In: C. H. L. Ong (ed.) CSL, LNCS, vol. 3634, pp. 248-262. Springer (2005). DOI 10.1007/11538363 18
293. Tomlin, C., Pappas, G. J., Sastry, S.: Conflict resolution for air traffic management: a study in multi-agent hybrid systems. IEEE T. Automat. Contr. 43(4), 509-521 (1998). DOI10.1109/9.664154
294. Tomlin, C. J., Lygeros, J., Sastry, S.: A game theoretic approach to controller design for hybrid systems. Proc. IEEE 88(7), 949-970 (2000). DOI 10.1109/5.871303
295. Umeno, S., Lynch, N. A.: Proving safety properties of an aircraft landing protocol using I/O automata and the PVS theorem prover: A case study. In: J. Misra, T. Nipkow, E. Sekerinski (eds.) FM, LNCS, vol. 4085, pp. 64-80. Springer (2006). DOI 10.1007/11813040 5
296. Umeno, S., Lynch, N. A.: Safety verification of an aircraft landing protocol: A refinement approach. In: Bemporad et al. [41], pp. 557-572. DOI 10.1007/978-3-540-71493-4 43
297. Walter, W.: Ordinary Differential Equations. Springer (1998)
298. Weihrauch, K.: Computable Analysis. Springer (2005)
299. Weispfenning, V.: The complexity of linear problems in fields. J. Symb. Comput. 5(1/2), 3-27 (1988). DOI 10.1016/S0747-7171 (88) 80003-8
300. Weispfenning, V.: Quantifier elimination for real algebra - the cubic case. In: ISSAC, pp. 258-263 (1994). DOI 10.1145/190347.190425
301. Weispfenning, V.: Quantifier elimination for real algebra - the quadratic case and beyond. Appl. Algebra Eng. Commun. Comput. 8(2), 85-101 (1997). DOI 10.1007/s002000050055
302. Witsenhausen, H. S.: A class of hybrid-state continuous-time dynamic systems. IEEE Trans. Automat. Contr. 11, 161-167 (1966)
303. Wolfram Research, Inc., Champaign, IL: Mathematica, version 5.2 edn. (2005). http://www.wolfram.com
304. Zeidler, E. (ed.): Teubner-Taschenbuch der Mathematik I. Teubner (2003)
305. Zhou, C., Hansen, M. R.: Duration Calculus: A Formal Approach to Real-Time Systems. Monographs in Theoretical Computer Science. Springer (2004)
306. Zhou, C., Ravn, A. P., Hansen, M. R.: An extended duration calculus for hybrid real-time systems. In: Grossman et al. [144], pp. 36-59