Showing cs.LOShow all
2 papers · 1 filter
cs.LO2015
On the Hardness of PCTL Satisfiability
Souymodip Chakraborty, Joost-Pieter Katoen
This paper shows that the satisfiability problem for probabilistic CTL (PCTL, for short) is undecidable. By a reduction from -player games with PCTL winning objective…
cs.LO2014
Parametric LTL on Markov Chains
Souymodip Chakraborty, Joost-Pieter Kataon
This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the until-modality is equipped with a bound that contains v…