Optimal Strategies in Priced Timed Game Automata

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

75 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
Title of host publicationFSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Subtitle of host publication24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
EditorsKamal Lodaya, Meena Mahajan
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages148-160
ISBN (Electronic)978-3-540-30538-5
ISBN (Print)978-3-540-24058-7
DOIs
Publication statusPublished - 16 Dec 2004
Externally publishedYes
Event24th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004 - Chennai, India
Duration: 16 Dec 200418 Dec 2004
Conference number: 24

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume3328
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Workshop

Workshop24th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004
Abbreviated titleFSTTCS
Country/TerritoryIndia
CityChennai
Period16/12/0418/12/04

Keywords

  • n/a OA procedure

Fingerprint

Dive into the research topics of 'Optimal Strategies in Priced Timed Game Automata'. Together they form a unique fingerprint.

Cite this