By Topic

Decidability results for parametric probabilistic transition systems with an application to security

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. Lanotte ; Dipt. di Sci. della Cultura, Universita dell'Insubria, Como, Italy ; A. Maggiolo-Schettini ; A. Troina

We develop a model of parametric probabilistic transition systems. In this model probabilities associated with transitions may be parameters, and we show how to find instances of parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a given state. We show, as an application, the model of a probabilistic non repudiation protocol. 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).

Published in:

Software Engineering and Formal Methods, 2004. SEFM 2004. Proceedings of the Second International Conference on

Date of Conference:

28-30 Sept. 2004