Searching for "Pfaffian Hybrid Systems." – sorted by Relevance.
-
Pfaffian hybrid systems
- Pfaffian hybrid systems Margarita Korovina 1 and Nicolai Vorobjov 2 1 A.P.Ershov Institute
- Cited by 8 (2 self) – Add To MetaCart
-
A survey on continuous time computations
- computational perspective. Hybrid systems and automata theory, for example, are two sources. A wide range
- Add To MetaCart
-
Control in o-minimal hybrid systems
- of the finite bisimulation in the case of pfaffian hybrid systems. Different word encoding techniques have been
- Cited by 1 (1 self) – Add To MetaCart
-
Weighted o-minimal hybrid systems are more decidable than weighted timed automata
- of the coarsest finite bisimulation of Pfaffian hybrid systems (see [KV06]). ⋆ Work partly supported by ACI
- Cited by 1 (0 self) – Add To MetaCart
-
Words and bisimulation of dynamical systems
- was introduced in our paper “On o-minimal hybrid systems” in order to give a new proof of the existence of a
- Cited by 4 (4 self) – Add To MetaCart

