×
This paper studies the synthesis problem for PCTL in PMDPs: Given a specification Φ in PCTL, we synthesise the parameter valuations under which Φ is true.
This paper studies the synthesis problem for PCTL in PMDPs: Given a specification. Φ in PCTL, we synthesise the parameter valuations under which Φ is true.
Apr 25, 2015 · In parametric Markov decision processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters ...
Abstract-Markov decision processes (MDPs) are often used for modelling distributed systems with probabilistic failure or randomisation. We consider the problem ...
In parametric Markov decision processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters.
Fingerprint. Dive into the research topics of 'Synthesis for PCTL in Parametric Markov Decision Processes'. Together they form a unique fingerprint.
Ernst Moritz Hahn, Tingting Han, Lijun Zhang: Synthesis for PCTL in Parametric Markov Decision Processes. NASA Formal Methods 2011: 146-161.
A complexity-theoretic discussion of the model-checking problem for parametric Markov chains and probabilistic computation tree logic (PCTL) formulas.
My thesis [1] covers various aspects of parameter synthesis in Markov models. It also covers aspects of structural synthesis via sketching.
Get details about the chapter of Synthesis for PCTL in Parametric Markov Decision Processes from book NASA Formal Methods: Third International Symposium, ...