Sciweavers

Share
CSL
2004
Springer

Pfaffian Hybrid Systems

12 years 5 months ago
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.
Margarita V. Korovina, Nicolai Vorobjov
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where CSL
Authors Margarita V. Korovina, Nicolai Vorobjov
Comments (0)
books