Model checking probabilistic timed automata with one or two clocks
Jurdzinski, Marcin, Sproston, Jeremy, Laroussinie, Francois and Huth, Michael. (2008) Model checking probabilistic timed automata with one or two clocks. Logical Methods in Computer Science, Vol.4 (No.3). p. 12. ISSN 1860-5974Full text not available from this repository.
Official URL: http://dx.doi.org/10.2168/LMCS-4(3:12)2008
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless of how nondeterminism is resolved) are PTIME-complete for one-clock probabilistic timed automata, and are EXPTIME-complete for probabilistic timed automata with two clocks. Secondly, we show that, for one-clock probabilistic timed automata, the model-checking problem for the probabilistic timed temporal logic PCTL is EXPTIME-complete. However, the model-checking problem for the subclass of PCTL which does not permit both punctual timing bounds, which require the occurrence of an event at an exact time point, and comparisons with probability bounds other than 0 or 1, is PTIME-complete for one-clock probabilistic timed automata.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Divisions:||Faculty of Science > Computer Science|
|Journal or Publication Title:||Logical Methods in Computer Science|
|Publisher:||International Federation for Computational Logic|
|Official Date:||26 September 2008|
|Page Range:||p. 12|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)