An Isaac Newton Institute Programme

Logic and Algorithms

O-minimal hybrid systems, bisimulation and control

18th April 2006

Author: Thomas Brihaye (Mons-Hainault)

Abstract

In this talk, in order to study bisimulations on o-minimal hybrid systems, we explain how to symbolically encode the trajectories of the systems through words. This method was introduced in our paper "On o-minimal hybrid systems" in order to give a new proof of the existence of a finite bisimulation for o-minimal hybrid systems (as previously proved in a paper by Lafferriere G., Pappas G.J. and Sastry S. in 2000). Then we will consider control (reachability) problem on o-minimal hybrid systems and we will see that the previously discussed word encoding technique can help in order to solve this problem.