Optimal strategies in priced timed game automata

Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim G. Larsen

Research output: Contribution to journalConference paperpeer-review

76 Citations (Scopus)

Abstract

Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.

Original languageEnglish
Pages (from-to)148-160
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3328
Publication statusPublished - 2004
Externally publishedYes

Fingerprint

Dive into the research topics of 'Optimal strategies in priced timed game automata'. Together they form a unique fingerprint.

Cite this