Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security

Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ruggero Lanotte

Venue:	In Proc. of SEFM’04, IEEE
Citations:	5 - 3 self

BibTeX

@INPROCEEDINGS{Lanotte04decidabilityresults,
    author = {Ruggero Lanotte},
    title = {Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security},
    booktitle = {In Proc. of SEFM’04, IEEE},
    year = {2004},
    pages = {114--121},
    publisher = {Press}
}

Bookmark

OpenURL

Abstract

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).

Citations

371	A.: Bisimulation through Probabilistic Testing - Larsen, Skou - 1991
141	Time and probability in formal design of distributed systems - Hansson - 1991
79	Specification and refinement of probabilistic processes - Jonsson, Larsen - 1991
66	Axiomatizing probabilistic processes: ACP with generative probabilities - Baeten, Bergstra, et al. - 1995
50	Testing preorders for probabilistic processes - Cleaveland, Dayar, et al. - 1999
35	How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems - Alfaro - 1998
31	Computing minimum and maximum reachability times in probabilistic systems - Alfaro - 1999
28	Probabilistic NonRepudiation without Trusted Third - Markowitch, Roggeman - 1999
20	On the verification of qualitative properties of probabilistic processes under fairness constraints - Baier, Kwiatkowska - 1998
16	Compositional analysis of expected delays in networks of probabilistic I/O automata - Stark, Smolka - 1998
14	Halmos: Measure theory - R - 1974
14	Weak bisimulation for probabilistic timed automata and applications to security - Lanotte, Maggiolo-Schettini, et al. - 2003
12	Composition and behaviors of probabilistic - Wu, Smolka, et al. - 1997
11	Security analysis of a probabilistic nonrepudiation protocol - Aldini, Gorrieri
4	Model checking for probabilistic time logic with fairness - Baier, Kwiatkowska - 1998
4	Automatic Analysis of a Non-Repudiation Protocol - Lanotte, Maggiolo-Schettini, et al. - 2004
4	A decomposition theorem for probabilistic transition systems - Maler - 1995
3	Model checking of probabilistic and deterministic systems - Bianco, Alfaro - 1995
2	A logic characterization of bisimulation for Markov Processes - Desharnais, Edalat, et al. - 1998
1	Markov Decision Processes and Buchi - Beauquier