International audienceTime-bounded reachability problems are concerned with assessing whether a model’s trajectories traverse a given region of the state-space within given time-bounds. In the case of stochastic models reachability is associated with a measure of probability which depends on the model’s parameters. In this paper we propose a methodology that, given a reachability specification (for a parametric stochastic model), allows for computing a reachability related probability distribution on the parameter space, i.e. a distribution that allows for identifying regions of the parameter space for which there is a non-null probability to match the considered reachability specification. The methodology relies on the characterisation of ...
The stochastic hybrid systems constitute well established classes of realistic models of hybrid disc...
Probabilistic timed automata (PTAs) are used for formal modelling and verifi-cation of systems with ...
AbstractVerification of reachability properties for probabilistic systems is usually based on varian...
Abstract. Given a parametric Markov model, we consider the problem of computing the rational functio...
We present a novel approach to compute reachable sets of dynamical systems with uncertain initial co...
As automated control systems grow in prevalence and complexity, there is an increasing demand for v...
Abstract — We propose a novel stochastic extension of timed automata, i.e. Markovian Timed Automata....
This paper proposes a technique to synthesize parametric rate values in continuous-time Markov chain...
In this paper, we consider the behavioral pseu-dometrics for probabilistic systems. The model we are...
When designing optimal controllers for any system, it is often the case that the true state of the s...
In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quant...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
We report on new strategies for model checking quantitative reachability properties of Markov decisi...
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automa...
Abstract. We report on a novel development to model check quantita-tive reachability properties on M...
The stochastic hybrid systems constitute well established classes of realistic models of hybrid disc...
Probabilistic timed automata (PTAs) are used for formal modelling and verifi-cation of systems with ...
AbstractVerification of reachability properties for probabilistic systems is usually based on varian...
Abstract. Given a parametric Markov model, we consider the problem of computing the rational functio...
We present a novel approach to compute reachable sets of dynamical systems with uncertain initial co...
As automated control systems grow in prevalence and complexity, there is an increasing demand for v...
Abstract — We propose a novel stochastic extension of timed automata, i.e. Markovian Timed Automata....
This paper proposes a technique to synthesize parametric rate values in continuous-time Markov chain...
In this paper, we consider the behavioral pseu-dometrics for probabilistic systems. The model we are...
When designing optimal controllers for any system, it is often the case that the true state of the s...
In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quant...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
We report on new strategies for model checking quantitative reachability properties of Markov decisi...
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automa...
Abstract. We report on a novel development to model check quantita-tive reachability properties on M...
The stochastic hybrid systems constitute well established classes of realistic models of hybrid disc...
Probabilistic timed automata (PTAs) are used for formal modelling and verifi-cation of systems with ...
AbstractVerification of reachability properties for probabilistic systems is usually based on varian...