loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
Control in o-minimal Hybrid Systems
Seattle, Washington
August 12-August 15
ISBN: 0-7695-2631-4
ASCII Text
x 
 
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier, "Control in o-minimal Hybrid Systems," Logic in Computer Science, Symposium on, pp. 367-378, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2006.22,
author = {Patricia Bouyer and Thomas Brihaye and Fabrice Chevalier},
title = {Control in o-minimal Hybrid Systems},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2006},
issn = {1043-6871},
pages = {367-378},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2006.22},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Control in o-minimal Hybrid Systems
SN - 1043-6871
SP367
EP378
A1 - Patricia Bouyer,
A1 - Thomas Brihaye,
A1 - Fabrice Chevalier,
PY - 2006
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
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.