4 search results - page 1 / 1 » Regular Expressions for PCTL Counterexamples |
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
QEST
2010
IEEE
13 years 2 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...