Probabilistic Computation Tree Logic (PCTL) is the established temporal logic for probabilistic verification of discrete-time Markov chains. Probabilistic model checking is a technique that verifies or refutes whether a property specified in this logic holds in a Markov chain. But Markov chains are often infinite or too large for this technique to apply. A standard solution to this problem is to convert the Markov chain to an abstract model and to model check that abstract model. The problem this thesis therefore studies is whether or when such finite abstractions of Markov chains for model checking PCTL exist. This thesis makes the following contributions. We identify a sizeable fragment of PCTL for which 3-valued Markov chains c...
In this thesis we focus on new methods for probabilistic model checking (PMC) with linear temporal l...
Markov automata constitute a compositional modeling formalism spanning as special cases the models o...
Probabilistic automata (PAs) have been successfully applied in formalverification of concurrent and ...
AbstractWe introduce p-Automata, which are automata that accept languages of Markov chains, by adapt...
We present p-automata, which accept an entire Markov chain as input. Acceptance is determined by sol...
AbstractWe introduce p-Automata, which are automata that accept languages of Markov chains, by adapt...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
AbstractWe generalize the familiar semantics for probabilistic computation tree logic from finite-st...
This work extends the abstraction-refinement paradigm based on 3-valued logics to the setting of pro...
AbstractThis paper proposes a novel abstraction technique for fully probabilistic systems. The model...
In this thesis we focus on new methods for probabilistic model checking (PMC) with linear temporal l...
We present Hintikka games for formulae of the proba-bilistic temporal logic PCTL and countable label...
In this paper, we first resolve an open question in the probabilistic verification of infinite-state...
In this thesis we focus on new methods for probabilistic model checking (PMC) with linear temporal l...
Markov automata constitute a compositional modeling formalism spanning as special cases the models o...
Probabilistic automata (PAs) have been successfully applied in formalverification of concurrent and ...
AbstractWe introduce p-Automata, which are automata that accept languages of Markov chains, by adapt...
We present p-automata, which accept an entire Markov chain as input. Acceptance is determined by sol...
AbstractWe introduce p-Automata, which are automata that accept languages of Markov chains, by adapt...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
AbstractWe generalize the familiar semantics for probabilistic computation tree logic from finite-st...
This work extends the abstraction-refinement paradigm based on 3-valued logics to the setting of pro...
AbstractThis paper proposes a novel abstraction technique for fully probabilistic systems. The model...
In this thesis we focus on new methods for probabilistic model checking (PMC) with linear temporal l...
We present Hintikka games for formulae of the proba-bilistic temporal logic PCTL and countable label...
In this paper, we first resolve an open question in the probabilistic verification of infinite-state...
In this thesis we focus on new methods for probabilistic model checking (PMC) with linear temporal l...
Markov automata constitute a compositional modeling formalism spanning as special cases the models o...
Probabilistic automata (PAs) have been successfully applied in formalverification of concurrent and ...