Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas - 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 Automata

Authors: Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas

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}).


Source : oai:arXiv.org:0805.1457
DOI : 10.2168/LMCS-4(2:9)2008
Volume: Volume 4, Issue 2
Published on: June 20, 2008
Submitted on: June 25, 2015
Keywords: Computer Science - Logic in Computer Science,Computer Science - Computational Complexity,Computer Science - Computer Science and Game Theory,F.1.1,F.3.1


Share

Browsing statistics

This page has been seen 17 times.
This article's PDF has been downloaded 11 times.