Pfaffian Hybrid Systems

  • Margarita Korovina
  • Nicolai Vorobjov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3210)

Abstract

It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same problem for a transition system associated with a continuous dynamical system. It was recently proved by several authors that under certain natural assumptions such finite bisimulation exists. In the paper we consider o-minimal systems defined by Pfaffian functions, either implicitly (via triangular systems of ordinary differential equations) or explicitly (by means of semi-Pfaffian maps). We give explicit upper bounds on the sizes of bisimulations as functions of formats of initial dynamical systems. We also suggest an algorithm with an elementary (doubly-exponential) upper complexity bound for computing finite bisimulations of these systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Margarita Korovina
    • 1
  • Nicolai Vorobjov
    • 2
  1. 1.A.P.Ershov Institute of Informatics Systems, Russian Academy of Sciences 
  2. 2.Department of Computer ScienceUniversity of BathBathEngland

Personalised recommendations