@inbook{ea2de95ce6534c59afb1399c4957a8df,

title = "Pfaffian hybrid systems",

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.",

author = "M Korovina and N Vorobjov",

note = "ID number: ISI:000224024900033",

year = "2004",

language = "English",

isbn = "0302-9743",

volume = "3210",

series = "Lecture Notes in Computer Science",

pages = "430--441",

booktitle = "Computer Science Logic, Proceedings",

}