Skip to main content
Log in

Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We study finite bisimulations of dynamical systems in ℝn defined by Pfaffian maps. The pure existence of finite bisimulations for a more general class of o-minimal systems was shown in Brihaye et al. (Lecture Notes in Comput. Sci. 2993, 219–233, 2004), Davoren (Theor. Inf. Appl. 33(4/5), 357–382, 1999), Lafferriere et al. (Math. Control Signals Syst. 13, 1–21, 2000). In Lecture Notes in Comput. Sci. 3210, 2004, the authors proved a double exponential upper bound on the size of a bisimulation in terms of the size of description of the dynamical system. In the present paper we improve it to a single exponential upper bound, and show that this bound is tight, by exhibiting a parameterized class of systems on which it is attained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2003)

    MATH  Google Scholar 

  2. Brihaye, T., Michaux, C., Riviere, C., Troestler, C.: On o-minimal hybrid systems. In: Alur, R., Pappas, G.J. (eds.) Proceedings of HSCC 2004. Lecture Notes in Comput. Sci., vol. 2993, pp. 219–233 (2004)

  3. Davoren, J.M.: Topologies, continuity and bisimulations. Theor. Inf. Appl. 33(4/5), 357–382 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gabrielov, A., Vorobjov, N.: Complexity of stratifications of semi-Pfaffian sets. Discret. Comput. Geom. 14, 71–91 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gabrielov, A., Vorobjov, N.: Complexity of computations with Pfaffian and Noetherian functions. In: Ilyashenko, Y. et al. (eds.) Normal Forms, Bifurcations and Finiteness Problems in Differential Equations. NATO Science Series II, vol. 137, pp. 211–250. Kluwer, Dordrecht (2004)

    Google Scholar 

  6. Gabrielov, A., Vorobjov, N., Zell, T.: Betti numbers of semialgebraic and sub-Pfaffian sets. J. Lond. Math. Soc. 69(1), 27–43 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hirsch, M.: Differential Topology. Springer, New York (1976)

    MATH  Google Scholar 

  8. Korovina, M., Vorobjov, N.: Pfaffian hybrid systems. In: Computer Science Logic’04. Lecture Notes in Comput. Sci., vol. 3210, pp. 430–441 (2004)

  9. Korovina, M., Vorobjov, N.: Upper and lower bounds on sizes of finite bisimulations of Pfaffian hybrid systems. In: Logical Approaches to Computational Barriers. Lecture Notes in Comput. Sci., vol. 3988, pp. 267–276

  10. Kurdyka, K., Orro, P., Symon, S.: Semialgebraic Sard theorem for generalized critical values. J. Differ. Geom. 56, 67–92 (2000)

    MATH  Google Scholar 

  11. Lafferriere, G., Pappas, G., Sastry, S.: O-minimal hybrid systems. Math. Control Signals Syst. 13, 1–21 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Massey, W.S.: A Basic Course in Algebraic Topology. Springer, New York (1991)

    MATH  Google Scholar 

  13. Zell, T.: Betti numbers of semi-Pfaffian sets. J. Pure Appl. Algebra 139, 323–338 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Margarita Korovina.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Korovina, M., Vorobjov, N. Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Theory Comput Syst 43, 498–515 (2008). https://doi.org/10.1007/s00224-007-9019-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9019-4

Keywords

Navigation