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). © British Computer Society 2007.
Author supplied keywords
Cite
CITATION STYLE
Lanotte, R., Maggiolo-Schettini, A., & Troina, A. (2007). Parametric probabilistic transition systems for system design and analysis. Formal Aspects of Computing, 19(1), 93–109. https://doi.org/10.1007/s00165-006-0015-2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.