We 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).
R. LANOTTE, A. MAGGIOLO-SCHETTINI, A. TROINA (2007). Parametric Probabilistic Transition Systems for System Design and Analysis. FORMAL ASPECTS OF COMPUTING, 19(1), 93-109 [10.1007/s00165-006-0015-2].
Parametric Probabilistic Transition Systems for System Design and Analysis
TROINA, ANGELO
2007
Abstract
We 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).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.