Symbolic Approximation of Weighted Timed Games

Damien Busatto-Gaston 1 Benjamin Monmege 1 Pierre-Alain Reynier 1
1 MOVE - Modélisation et Vérification
LIS - Laboratoire d'Informatique et Systèmes
Abstract : 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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Benjamin Monmege <>
Submitted on : Monday, February 25, 2019 - 2:03:07 PM
Last modification on : Tuesday, March 5, 2019 - 1:42:18 AM
Long-term archiving on : Sunday, May 26, 2019 - 1:12:47 PM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads