none3noWe develop a model of parametric probabilistic transition Systems (PPTSs), where probabilities associated with transitions may be parameters. We show how to find instances of the parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a certain state. As an application, we model a probabilistic non-repudiation protocol with a PPTS. The theory we develop allows us to find instances that maximize the probability that the protocol ends in a fair state (no participant has an advantage over the others).noneR. LANOTTE; A. MAGGIOLO-SCHETTINI; A. TROINAR. LANOTTE; A. MAGGIOLO-SCHETTINI; A. TROIN
Probabilistic transition system specifications (PTSSs) in the ntmufnu/ntmuxnu format provide structu...
The parameter synthesis problem aims to find parameter valuations that guarantee that a given object...
We consider probabilistic transition systems, based on probabilistic automata of Segala & Lynch ...
Abstract. We develop a model of Parametric Probabilistic Transition Systems, where probabilities ass...
We develop a model of Parametric Probabilistic Transition Systems. In this model probabilities assoc...
none3noneR. LANOTTE; A. MAGGIOLO-SCHETTINI; A. TROINAR. LANOTTE; A. MAGGIOLO-SCHETTINI; A. TROIN
Probabilistic modelling has proved useful to analyse performance, reliability and energy usage of di...
Markov models comprise states with probabilistic transitions. The analysis of these models is ubiqui...
A generative model for extending algebraic protocol specifications with probabilities is presented. ...
International audienceWe consider the model-checking problem for parametric probabilistic dynamical ...
Markov chain analysis is a key technique in reliability engineering. A practical obstacle is that al...
Abstract. The paper studies automatic verification of liveness properties with probability 1 over pa...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
Abstract: Probabilistic timed automata can be used to model systems in which probabilistic and timin...
Abstract. Given a parametric Markov model, we consider the problem of computing the rational functio...
Probabilistic transition system specifications (PTSSs) in the ntmufnu/ntmuxnu format provide structu...
The parameter synthesis problem aims to find parameter valuations that guarantee that a given object...
We consider probabilistic transition systems, based on probabilistic automata of Segala & Lynch ...
Abstract. We develop a model of Parametric Probabilistic Transition Systems, where probabilities ass...
We develop a model of Parametric Probabilistic Transition Systems. In this model probabilities assoc...
none3noneR. LANOTTE; A. MAGGIOLO-SCHETTINI; A. TROINAR. LANOTTE; A. MAGGIOLO-SCHETTINI; A. TROIN
Probabilistic modelling has proved useful to analyse performance, reliability and energy usage of di...
Markov models comprise states with probabilistic transitions. The analysis of these models is ubiqui...
A generative model for extending algebraic protocol specifications with probabilities is presented. ...
International audienceWe consider the model-checking problem for parametric probabilistic dynamical ...
Markov chain analysis is a key technique in reliability engineering. A practical obstacle is that al...
Abstract. The paper studies automatic verification of liveness properties with probability 1 over pa...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
Abstract: Probabilistic timed automata can be used to model systems in which probabilistic and timin...
Abstract. Given a parametric Markov model, we consider the problem of computing the rational functio...
Probabilistic transition system specifications (PTSSs) in the ntmufnu/ntmuxnu format provide structu...
The parameter synthesis problem aims to find parameter valuations that guarantee that a given object...
We consider probabilistic transition systems, based on probabilistic automata of Segala & Lynch ...