Pfaffian hybrid systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3210, Issue , 2004, Pages 430-441

  Korovina, Margarita ^a   Vorobjov, Nicolai ^b  

^a A P ERSHOV INSTITUTE OF INFORMATICS SYSTEMS   (Russian Federation)

^b University of Bath   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIAL EQUATIONS; FAULT TOLERANCE; HYBRID SYSTEMS; ORDINARY DIFFERENTIAL EQUATIONS;

BISIMULATIONS; COMPLEXITY BOUNDS; CONTINUOUS DYNAMICAL SYSTEM; DISCRETE COMPONENTS; FINITE BISIMULATION; MINIMAL SYSTEMS; TRANSITION SYSTEM; TRIANGULAR SYSTEM;

DYNAMICAL SYSTEMS;

EID: 21844463638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_33     Document Type: Article

References (11)

1. S. Basu, R. Pollack and M.-F. Roy, Algorithms in Real Algebraic Geometry, Springer, Berlin-Heidelberg, 2003.
2. L. Blum, , F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, New York, 1997.
3. T. Brihaye, G. Michaux, C. Riviere, C. Troestler, On o-minimal hybrid systems, in: Hybrid Systems: Computation and Control, R. Alur, G. J. Pappas, (Eds.), LNCS, 2993, Springer, Heidelberg, 2004, 219-233.
4. A. Gabrielov, N. Vorobjov, Complexity of computations with Pfaffian and Noetherian functions, in: Normal Forms, Bifurcations and Finiteness Problems in Differential Equations, Yu. Ilyashenko et al., (Eds.), NATO Science Series II, 137, Kluwer, 2004, 211-250.
5. A. Gabrielov, N. Vorobjov, Complexity of cylindrical decompositions of subPfaffian sets, J. Pure and Appl. Algebra, 164, 1-2, 2001, 179-197.
6. A. Gabrielov, N. Vorobjov, Betti numbers of semialgebraic sets defined by quantifier-free formulae, to appear in: Discrete and Computational Geometry, 2004.
7. R.L. Grossman, et al., (Eds.), Hybrid Systems, LNCS, 736, Springer, BerlinHeidelberg, 1993, 474 p.
8. T. A. Henzinger, The theory of hybrid automata, in: Proceedings of 11th Ann. Symp. Logic in Computer Sci., IEEE Press, 1996, 278-292.
9. G. Lafferriere, G.J. Pappas, S. Sastry, O-minimal hybrid systems, Math. Control Signals Systems, 13, 2000, 1-21.
10. S. Pericleous, N. Vorobjov, New complexity bounds for cylindrical decompositions of sub-Pfaffian sets, in: Discrete and Computational Geometry. Goodman-Pollack Festschrift, B. Aronov et al. (Eds.), Springer, 2003, 673-694.
11. T. Zell, Betti numbers of semi-Pfaffian sets, J. Pure Appl. Algebra, 139, 1999, 323-338.