DI-UMONS : Dépôt institutionnel de l’université de Mons

Recherche transversale
Rechercher
(titres de publication, de périodique et noms de colloque inclus)
2008-09-01 - Article/Dans un journal avec peer-review - Anglais - 15 page(s)

Bouyer Patricia, Brihaye Thomas , Jurdzinski Marcin, Lazic Ranko, Rutkowski Michal, "Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets" in Lecture Notes in Computer Science, 5215, 63 - 77

  • Edition : Springer, Berlin (Germany)
  • Codes CREF : Informatique mathématique (DI1160)
  • Unités de recherche UMONS : Mathématiques effectives (S820)
Texte intégral :

Abstract(s) :

(Anglais) We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuous dynamics. A number of analysis problems, such as reachability testing and controller synthesis, are decidable for classes of o-minimal hybrid automata. We generalize existing decidability results for controller synthesis on hybrid automata and we establish new ones by proving that average-price and reachability-price games on hybrid systems with strong resets are decidable, provided that the structure on which the hybrid automaton is defined has a decidable first-order theory. Our proof techniques include a novel characterization of values in games on hybrid systems by optimality equations, and a definition of a new finitary equivalence relation on the states of a hybrid system which enables a reduction of games on hybrid systems to games on finite graphs.

Identifiants :
  • DOI : 10.1007/978-3-540-85778-5_6