Optimal strategies in priced timed game automata

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

Optimal strategies in priced timed game automata

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

Research output: Contribution to journal › Conference paper › peer-review

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 language	English
Pages (from-to)	148-160
Number of pages	13
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3328
Publication status	Published - 2004
Externally published	Yes

Cite this

@article{321549939617406a8c0d6a570d69bb81,

title = "Optimal strategies in priced timed game automata",

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.",

author = "Patricia Bouyer and Franck Cassez and Emmanuel Fleury and Larsen, {Kim G.}",

year = "2004",

language = "English",

volume = "3328",

pages = "148--160",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer, Springer Nature",

}

TY - JOUR

T1 - Optimal strategies in priced timed game automata

AU - Bouyer, Patricia

AU - Cassez, Franck

AU - Fleury, Emmanuel

AU - Larsen, Kim G.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35048890008&partnerID=8YFLogxK

M3 - Conference paper

AN - SCOPUS:35048890008

SN - 0302-9743

VL - 3328

SP - 148

EP - 160

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

Optimal strategies in priced timed game automata

Abstract

Other files and links

Fingerprint

Cite this