Paper: Control in o-minimal hybrid systems (at LICS 2006)

Authors: Patricia Bouyer Thomas Brihaye Fabrice Chevalier

Abstract

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.

BibTeX

  @InProceedings{BouyerBrihayeCheval-Controlinominimalhy,
    author = 	 {Patricia Bouyer and Thomas Brihaye and Fabrice Chevalier},
    title = 	 {Control in o-minimal hybrid systems},
    booktitle =  {Proceedings of the Twenty-First Annual IEEE Symposium on Logic in Computer Science (LICS 2006)},
    year =	 {2006},
    month =	 {August}, 
    pages =      {367--376},
    location =   {Seattle, Washington, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }