loading...
Control in o-minimal Hybrid Systems
Seattle, Washington August 12-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.2221st Annual IEEE Symposium on Logic i ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Patricia Bouyer, LSV - CNRS & ENS de Cachan, France
Thomas Brihaye, Universite de Mons-Hainaut, Belguim
Fabrice Chevalier, LSV - CNRS & ENS de Cachan, France
In this paper, we consider the control of general hybrid systems. In this context we show that time-abstract bisimulation is not adequate for solving such a problem. That is why we consider an other equivalence, namely the suffix equivalence based on the encoding of trajectories through words. We show that this suffix equivalence is in general a correct abstraction for control problems. We apply this result to o-minimal hybrid systems, and get decidability and computability results in this framework.
Citation:
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier, "Control in o-minimal Hybrid Systems," lics, pp.367-378, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.