Symbolic Approximation of Weighted Timed Games - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Symbolic Approximation of Weighted Timed Games

Benjamin Monmege
Pierre-Alain Reynier

Résumé

Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the accumulated weight while reaching a target. Weighted timed games are notoriously difficult and quickly undecidable, even when restricted to non-negative weights. For non-negative weights, the largest class that can be analysed has been introduced by Bouyer, Jaziri and Markey in 2015. Though the value problem is undecidable, the authors show how to approximate the value by considering regions with a refined granularity. In this work, we extend this class to incorporate negative weights, allowing one to model energy for instance, and prove that the value can still be approximated, with the same complexity. In addition, we show that a symbolic algorithm, relying on the paradigm of value iteration, can be used as an approximation schema on this class.
Fichier principal
Vignette du fichier
LIPIcs-FSTTCS-2018-28.pdf (532.55 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02014051 , version 1 (25-02-2019)

Identifiants

Citer

Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier. Symbolic Approximation of Weighted Timed Games. 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Dec 2018, Ahmedabad, India. ⟨10.4230/LIPIcs.FSTTCS.2018.28⟩. ⟨hal-02014051⟩
59 Consultations
38 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More