On the expressiveness and decidability of o-minimal hybrid systems

Journal of Complexity

Volumn 21, Issue 4, 2005, Pages 447-478

  Brihaye, Thomas ^a   Michaux, Christian ^a  

^a UNIVERSITY OF MONS   (Belgium)

Author keywords

Bisimulation; BSS model of computation; Decidability; Definability; Hybrid system; O minimality

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FINITE AUTOMATA; MATHEMATICAL MODELS; THEOREM PROVING;

BISIMULATION; DEFINABILITY; HYBRID SYSTEM;

HYBRID COMPUTERS;

EID: 21844468501     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2004.09.003     Document Type: Article

References (41)

1. R. Alur C. Courcoubetis N. Halbwachs T.A. Henzinger P.-H. Ho X. Nicollin A. Olivero J. Sifakis S. Yovine The algorithmic analysis of hybrid systems Theoret. Comput. Sci. 138 1995 3-34
2. R. Alur D.L. Dill A theory of timed automata Theoret. Comput. Sci. 126 1994 183-235
3. R. Alur T.A. Henzinger G. Lafferriere G.J. Pappas Discrete abstractions of hybrid systems Proc. IEEE 88 2000 971-984
4. E. Asarin, G. Schneider, S. Yovine, On the decidability of the reachability problem for planar differential inclusions, in: D. Benedetto, A. Sangiovanni-Vincentelli (Eds.), HSSC 01, Lecture Notes in Computer Science, vol. 2034, Springer, Berlin, 2001, pp. 89-104.
5. L. Blum F. Cucker M. Shub S. Smale Complexity and Real Computation 1998 Springer New York
6. L. Blum M. Shub S. Smale On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines Bull. Amer. Math. Soc. 21 1989 1-46
7. A. Bouajjani, J.-C. Fernandez, N. Halbwachs, Minimal model generation, in: R.P. Kurshan, E.M. Clarke (Eds.), CAV 90, Lecture Notes in Computer Science, vol. 531, Springer, Berlin, 1990, pp. 197-203.
8. T. Brihaye, Words combinatorics and bisimulations of dynamical systems, draft UMH.
9. T. Brihaye, C. Michaux, C. Rivière, C. Troestler, On o-minimal hybrid systems, extended abstract, in: R. Alur, G. J. Pappas (Eds.), HSSC 04, Lecture Notes in Computer Science, vol. 2993, Springer, Berlin, 2004, pp. 219-233.
10. D. Caucal, Bisimulation of context-free grammars and push-down automata, in: Ponse, Maarten de Rijke, Venema (Eds.), Modal Logic and Process Algebra, CSLI Lecture Notes, Stanford, vol. 53, 1995, pp. 85-106.
11. C. Chang H. Keisler Model Theory third ed. 1990 North-Holland Amsterdam
12. J.M. Davoren Topologies, Continuity and bisimulations Theoret. Inform. Appl. 33 4/5 1999 357-381
13. L. van den Dries Remarks on Tarski's problem concerning (ℝ, +, · , exp) In: G. Lolli G. Longo A. Marcja Eds. Logic Colloquium vol. 82 1984 North-Holland Amsterdam 97-121
14. L. van den Dries, o-Minimal structures, in: Logic: From Foundations to Applications, European Logic Colloquium, Oxford University Press, Oxford, 1996, pp. 137-185.
15. L. van den Dries Tame Topology and o-minimal Structures 1998 Cambridge University Press Cambridge
16. T.A. Henzinger, Hybrid automata with finite bisimulations, in: ICALP'95, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 324-335.
17. T.A. Henzinger The Theory of Hybrid Automata Proceedings of the 11th Annual Symposium on Logic in Computer Science 1996 IEEE Computer Society Press Silver Spring, MD 278-292
18. T.A. Henzinger P.W. Kopke A. Puri P. Varaiya What's decidable about hybrid automata? J. Comput. System Sci. 57 1998 94-124
19. Y. Kesten A. Pnueli J. Sifakis S. Yovine Decidable integration graphs Inform. Comput. 150 2 1999 209-243
20. A.G. Khovanski, Fewnomials, Translations of Mathematical Monographs, vol. 88, American Mathematical Society, Providence, RI, 1991.
21. M. Korovina, N. Vorobjov, Pfaffian hybrid systems, in: J. Marcinkowski, A. Tarlecki (Eds.), Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3210, Springer, Berlin, 2004, pp. 430-441.
22. G. Lafferriere G.J. Pappas S. Sastry o-Minimal Hybrid Systems Math. Control Signals Systems 13 2000 1-21
23. G. Lafferriere, G.J. Pappas, S. Yovine, A new class of decidable hybrid systems, in: F.W. Vaandrager, J.H. van Schuppen (Eds.), HSSC 99, Lecture Notes in Computer Science, vol. 1569, Springer, Berlin, 2000, pp. 137-151.
24. J.-M. Lion C. Miller P. Speissegger Differential equations over polynomially bounded o-minimal structures Proc. Amer. Math. Soc. 131 1 2003 175-183
25. J. Lygeros D.N. Godbole S. Sastry Verified hybrid controllers for automated vehicles IEEE Trans. Automat. Control 43 4 1998 522-539
26. A. Macintyre, A.J. Wilkie, On the decidability of the real exponential field, in: P. Odifreddi (Ed.), Kreiseliana, A.K., Peters, Wellesley, MA, 1996, pp. 441-467.
27. D. Marker, M. Messmer, A. Pillay, Model Theory of Fields, Lecture Notes in Logic, Springer, Berlin, 1996.
28. Y. Matiyasevich Hilbert's Tenth Problem 1993 The MIT Press Cambridge
29. K. Meer C. Michaux A survey on real structural complexity theory Bull. Belg. Math. Soc. 4 1997 113-148
30. J.S. Miller, Decidability and complexity results for timed automata and semi-linear hybrid automata, in: N. Lynch, B. Krogh (Eds.), HSSC 00, Lecture Notes in Computer Science, vol. 1790, Springer, Berlin, 2000, pp. 296-309.
31. C. Miller P. Speissegger Pfaffian differential equations over exponential o-minimal structures J. Symbolic Logic 67 1 2002 438-448
32. S. Pericleous N. Vorobjov New complexity bounds for cylindrical cell decompositions of sub-Pfaffian sets in: Discrete and Computational Geometry, The Goodman-Pollack Festschrift 2003 Springer Berlin
33. D. Perruci, Some bounds for the number of components or real zero sets of sparse polynomials, arXiv:mAth.AG/0311191 v1, 2003.
34. A. Pillay C. Steinhorn Definable sets in ordered structures I Trans. Amer. Math. Soc. 295 1986 565-592
35. B. Poizat, Les Petits Cailloux, une approche modèle-théorique de l'Algorithmie, Aléas, Lyon, 1995.
36. A. Shlapentokh, Hilbert's tenth problem over number fields, a survey, in: J. Denef (Ed.), Hilbert's tenthRproblem: relations with arithmetic and algebraic geometry (Ghent, 1999), Contemporary Mathematics, vol. 270, American Mathematical Society, Providence, RI, 2000, pp. 107-137.
37. S.N. Simić, K.H. Jonhansson, S. Sastry, J. Lygeros, Towards a geometric theory of hybrid systems, in: N. Lynch, B.H. Krogh (Eds.), HSSC 00, Lecture Notes in Computer Science, vol. 1790, Springer, Berlin, 2000, pp. 421-436.
38. C. Tomlin G.J. Pappas S. Sastry Conflict resolution for air traffic management: A study in multi-agent hybrid systems IEEE Trans. Automat. Control 43 4 1998 509-521
39. J. Truss Infinite permutation groups II-subgroups of small index J. Algebra 120 1989 494-515
40. A.J. Wilkie Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function J. Amer. Math. Soc. 9 4 1996 1051-1094
41. A.J. Wilkie, Schanuel's conjecture and the decidability of the real exponential field, in: Algebraic Model Theory (Toronto, Ont., 1996), NATO Advanced Scientific Institute Series C-Mathematics and Physics Sciences, vol. 496, Kluwer Academic Publishers, Dordrecht, 1997, pp. 223-230.