Control in o-minimal Hybrid Systems

Authors:
Patricia Bouyer;Thomas Brihaye;Fabrice Chevalier
Affiliations:
LSV - CNRS & ENS de Cachan, France;Universite de Mons-Hainaut, Belguim;LSV - CNRS & ENS de Cachan, France
Venue:
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Year:
2006

Citing 0
Cited 6

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
STORMED Hybrid Games

HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Specifications for decidable hybrid games

Theoretical Computer Science
Reachability in one-dimensional controlled polynomial dynamical systems

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics

Quantified Score

Hi-index	0.00

Visualization

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.