More or Less True DCTL for Continuous-Time MDPs
- 502 Downloads
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 .
Unable to display preview. Download preview PDF.
- 4.Jansen, D.N.: More or less true: DCTL for continuous-time MDPs. Tech. Rep. ICIS–R13006, Radboud Universiteit, Nijmegen (2013), http://www.cs.ru.nl/research/reports
- 5.Maplesoft: technical computing software for engineers, mathematicians, scientists, instructors and students, http://www.maplesoft.com/
- 9.Zhang, L., Jansen, D.N., Nielson, F., Hermanns, H.: Efficient CSL model checking using stratification. Logical Methods in Computer Science 8(2), paper 17 (2012)Google Scholar