Model checking durational probabilistic systems

  • Authors:
  • François Laroussinie;Jeremy Sproston

  • Affiliations:
  • Lab. Spécification & Verification, ENS Cachan, CNRS UMR 8643, France;Dipartimento di Informatica, Università di Torino, Torino, Italy

  • Venue:
  • FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider model-checking algorithms for durational probabilistic systems, which are systems exhibiting nondeterministic, probabilistic and discrete-timed behaviour. We present two semantics for durational probabilistic systems, and show how formulae of the probabilistic and timed temporal logic Ptctl can be verified on such systems. We also address complexity issues, in particular identifying the cases in which model checking durational probabilistic systems is harder than verifying non-probabilistic durational systems.