Patricia Bouyer ; Kim G. Larsen ; Nicolas Markey - Model Checking One-clock Priced Timed Automata

lmcs:828 - Logical Methods in Computer Science, June 20, 2008, Volume 4, Issue 2 -
Model Checking One-clock Priced Timed AutomataArticle

Authors: Patricia Bouyer ; Kim G. Larsen ; Nicolas Markey ORCID

    We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. We prove that, under the assumption that the model has only one clock, model-checking this class of models against the logic WCTL, CTL with cost-constrained modalities, is PSPACE-complete (while it has been shown undecidable as soon as the model has three clocks). We also prove that model-checking WMTL, LTL with cost-constrained modalities, is decidable only if there is a single clock in the model and a single stopwatch cost variable (i.e., whose slopes lie in {0,1}).

    Volume: Volume 4, Issue 2
    Published on: June 20, 2008
    Imported on: September 20, 2007
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Computational Complexity,Computer Science - Computer Science and Game Theory,F.1.1,F.3.1


    Is referenced by
    Model Checking Real-Time Systems
    • 1 ScholeXplorer


    Consultation statistics

    This page has been seen 821 times.
    This article's PDF has been downloaded 224 times.