On O-minimal hybrid systems

35Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is driven by a general motto: bisimulate a hybrid system by a finite symbolic dynamical system. In the case of o-minimal hybrid systems, the continuous and discrete components can be decoupled, and hence, the problem reduces in building a finite symbolic dynamical system for the continuous dynamics of each location. We show that this can be done for a quite general class of hybrid systems defined on o-minimal structures. In particular, we recover the main result of a paper by Lafferriere G., Pappas G.J. and Sastry S. on o-minimal hybrid systems. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Brihaye, T., Michaux, C., Rivière, C., & Troestler, C. (2004). On O-minimal hybrid systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2993, 219–233. https://doi.org/10.1007/978-3-540-24743-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free