Pfaffian Hybrid Systems
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.
Unable to display preview. Download preview PDF.
- 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.Grossman, R.L., et al.: HS 1991 and HS 1992. LNCS, vol. 736, p. 474. Springer, Heidelberg (1993)Google Scholar
- 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