Abstract. We report on new strategies for model checking quantita-tive reachability properties of Markov decision processes by successive renements. In our approach, properties are analyzed on abstractions rather than directly on the given model. Such abstractions are expected to be signicantly smaller than the original model, and may safely refute or accept the required property. Otherwise, the abstraction is rened and the process repeated. As the numerical analysis involved in settling the validity of the property is more costly than the renement process, the method prots from applying such numerical analysis on smaller state spaces. The method is signicantly enhanced by a number of novel strategies: a strategy for reducing the size of th...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
In this paper, we combine abstraction-refinement and symbolic techniques to fight the state-space ex...
Probabilistic model checking is a formal verification method, which is used to guarantee the correct...
We report on new strategies for model checking quantitative reachability properties of Markov decisi...
Abstract. We report on a novel development to model check quantita-tive reachability properties on M...
ABSTRACT. This paper focuses on optimizing probabilities of events of interest defined over general ...
AbstractWe consider a class of infinite-state Markov decision processes generated by stateless pushd...
We present a general framework for applying machine-learning algorithms to the verification of Marko...
Recent research in decision theoretic planning has focussed on making the solution of Markov decisio...
In the field of model checking, abstraction refinement has proved to be an extremely successful meth...
This paper focuses on optimizing probabilities of events of interest defined over general controlled...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
We consider a class of infinite-state Markov decision processes generated by stateless pushdown auto...
We consider the problem of approximating the reachability probabilities in Markov decision processes...
Abstract. We present a general framework for applying machine-learning algo-rithms to the verificati...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
In this paper, we combine abstraction-refinement and symbolic techniques to fight the state-space ex...
Probabilistic model checking is a formal verification method, which is used to guarantee the correct...
We report on new strategies for model checking quantitative reachability properties of Markov decisi...
Abstract. We report on a novel development to model check quantita-tive reachability properties on M...
ABSTRACT. This paper focuses on optimizing probabilities of events of interest defined over general ...
AbstractWe consider a class of infinite-state Markov decision processes generated by stateless pushd...
We present a general framework for applying machine-learning algorithms to the verification of Marko...
Recent research in decision theoretic planning has focussed on making the solution of Markov decisio...
In the field of model checking, abstraction refinement has proved to be an extremely successful meth...
This paper focuses on optimizing probabilities of events of interest defined over general controlled...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
We consider a class of infinite-state Markov decision processes generated by stateless pushdown auto...
We consider the problem of approximating the reachability probabilities in Markov decision processes...
Abstract. We present a general framework for applying machine-learning algo-rithms to the verificati...
Markov decision processes (MDPs) are natural models of computation in a wide range of applications. ...
In this paper, we combine abstraction-refinement and symbolic techniques to fight the state-space ex...
Probabilistic model checking is a formal verification method, which is used to guarantee the correct...