Model Checking One-clock Priced Timed Automata

Details Model Checking One-clock Priced Timed Automata Model Checking One-clock Priced Timed Automata

2008-05-10

arxiv.org/abs/0805.1457v2

LMCS 4 (2:9) 2008

Computer Science

Logic in Computer Science

28 pages

Scientific paper

10.2168/LMCS-4(2:9)2008

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

Affiliated with

Also associated with

No associations

Rating

Model Checking One-clock Priced Timed Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Model Checking One-clock Priced Timed Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model Checking One-clock Priced Timed Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188692