Synthesis of optimal strategies using HyTeCH.

P. Bouyer, F. Cassez, E. Fleury, K.G. Larsen

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

    11 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 languageUndefined
    Title of host publicationProceedings of the workshop on games in design and verification (GDV 2004).
    EditorsL. de Alfaro
    PublisherElsevier
    Pages11-31
    DOIs
    Publication statusPublished - 18 Jun 2005

    Publication series

    Name
    Number1
    Volume119
    ISSN (Print)1571-0661
    ISSN (Electronic)1571-0661

    Keywords

    • METIS-233671

    Cite this