Pfaffian hybrid systems

M Korovina, N Vorobjov

Research output: Chapter in Book/Report/Conference proceedingChapter

9 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationComputer Science Logic, Proceedings
Pages430-441
Number of pages12
Volume3210
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science

    Fingerprint

Cite this

Korovina, M., & Vorobjov, N. (2004). Pfaffian hybrid systems. In Computer Science Logic, Proceedings (Vol. 3210, pp. 430-441). (Lecture Notes in Computer Science).