More or less true: DCTL for continuous-time MDPs

  • Authors:
  • David N. Jansen

  • Affiliations:
  • Model-Based System Development, Radboud Universiteit, Nijmegen, The Netherlands

  • Venue:
  • FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Discounted Computation Tree Logic is a logic that measures utility (as a real value in the interval [0,1]) instead of discrete truth (only 0 or 1). It is able to express properties that give more weight to the near future than to the far future. This article extends earlier work on DCTL with time, to continuous-time Markov chains and continuous-time Markov decision processes. It presents model checking algorithms for the two possible semantics of DCTL. A long version of this article containing full proofs is available as [4].