Sciweavers

3 search results - page 1 / 1
» Hintikka Games for PCTL on Labeled Markov Chains
Sort
View
QEST
2008
IEEE
13 years 10 months ago
Hintikka Games for PCTL on Labeled Markov Chains
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...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...
PE
2010
Springer
180views Optimization» more  PE 2010»
13 years 2 months ago
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...
IANDC
2010
116views more  IANDC 2010»
13 years 2 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...