Model checking probabilistic timed automata with one or two clocks

  • Authors:

  • Marcin Jurdziński;François Laroussinie;Jeremy Sproston

  • Affiliations:

  • Department of Computer Science, University of Warwick, Coventry, UK;Lab. Spécification & Verification, ENS Cachan, CNRS UMR, France;Dipartimento di Informatica, Università di Torino, Torino, Italy

  • Venue:
  • TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 the model-checking problem for the probabilistic timed temporal logic PTCTL is EXPTIME-complete for one clock probabilistic timed automata. However, the corresponding model-checking problem for the subclass of PTCTL which does not permit both (1) punctual timing bounds, which require the occurrence of an event at an exact time point, and (2) comparisons with probability bounds other than 0 or 1, is PTIME-complete.