Synthesis of Optimal Strategies Using HyTech

Patricia Bouyer; Franck Cassez; Kim Guldstrand Larsen; Emmanuel Fleury

Synthesis of Optimal Strategies Using HyTech

Patricia Bouyer, Franck Cassez, Kim Guldstrand Larsen, Emmanuel Fleury

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

14 Citations (Scopus)

Abstract

Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.

Original language	English
Title of host publication	Proceedings of the Workshop on Games in Design and Verification
Publisher	Elsevier
Publication date	2005
Pages	11-31
Publication status	Published - 2005
Event	Workshop on Games in Design and Verification (GDV 2004) - Duration: 19 May 2010 → …

Conference

Conference	Workshop on Games in Design and Verification (GDV 2004)
Period	19/05/2010 → …

Series	Electronic Notes of Theoretical Computer Science
Number	1
Volume	119

Keywords

optimal strategies
priced timed autoamata
HyTech

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inproceedings{f10226d031c511db8de7000ea68e967b,

title = "Synthesis of Optimal Strategies Using HyTech",

abstract = "Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.",

keywords = "optimal strategies, priced timed autoamata, HyTech",

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

year = "2005",

language = "English",

series = "Electronic Notes of Theoretical Computer Science",

publisher = "Elsevier",

number = "1",

pages = "11--31",

booktitle = "Proceedings of the Workshop on Games in Design and Verification",

address = "United Kingdom",

note = "Workshop on Games in Design and Verification (GDV 2004) ; Conference date: 19-05-2010",

}

Synthesis of Optimal Strategies Using HyTech. / Bouyer, Patricia; Cassez, Franck; Larsen, Kim Guldstrand et al.
Proceedings of the Workshop on Games in Design and Verification. Elsevier, 2005. p. 11-31 (Electronic Notes of Theoretical Computer Science; No. 1, Vol. 119).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Synthesis of Optimal Strategies Using HyTech

AU - Bouyer, Patricia

AU - Cassez, Franck

AU - Larsen, Kim Guldstrand

AU - Fleury, Emmanuel

PY - 2005

Y1 - 2005

N2 - Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.

AB - Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. The problem of synthesizing an optimal winning strategy for a priced timed game under some hypotheses has been shown decidable in [P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. Research Report BRICS RS-04-4, Denmark, Feb. 2004. Available at http://www.brics.dk/RS/04/4/]. In this paper, we present an algorithm for computing the optimal cost and for synthesizing an optimal strategy in case there exists one. We also describe the implementation of this algorithm with the tool HyTech and present an example.

KW - optimal strategies

KW - priced timed autoamata

KW - HyTech

M3 - Article in proceeding

T3 - Electronic Notes of Theoretical Computer Science

SP - 11

EP - 31

BT - Proceedings of the Workshop on Games in Design and Verification

PB - Elsevier

T2 - Workshop on Games in Design and Verification (GDV 2004)

Y2 - 19 May 2010

ER -

Synthesis of Optimal Strategies Using HyTech

Abstract

Conference

Keywords

AUB Link

Fingerprint

Cite this