(Enter summary)
Abstract: We are interested in describing timed systems that exhibit
probabilistic behaviors. To this purpose, we define a model
of probabilistic timed automata and give a concept of weak
bisimulation together with an algorithm to decide it. We
use this model for describing and analyzing a probabilistic
non-repudiation protocol in a timed setting. (Update)
Cited by: More
Decidability Results for Parametric Probabilistic Transition.. - Lanotte, al.
(Correct)
Team Automata for Security Analysis - Beek, Lenzini, al.
(Correct)
Similar documents (at the sentence level):
5.5%: Weak Bisimulation for Probabilistic Timed Automata - And Applications To
(Correct)
Active bibliography (related documents): More All
0.2: Automatic Verification of Real-time Systems with.. - Kwiatkowska.. (2000)
(Correct)
0.2: Two Formal Approaches for Approximating.. - Aldini, Bravetti.. (2004)
(Correct)
0.2: Verifying Soft Deadlines with Probabilistic Timed.. - Kwiatkowska, Norman.. (2000)
(Correct)
Similar documents based on text: More All
0.4: Information Flow Analysis for Probabilistic Timed Automata - Lanotte..
(Correct)
0.4: Automatic Analysis of the NRL Pump - Lanotte, Tini, Troina, Tronci (2004)
(Correct)
0.3: Verification of Hybrid Automata by Synthesis and.. - Andrea..
(Correct)
Related documents from co-citation: More All
2: Specification and Refinement of Probabilistic Processes (context) - Jonsson, Larsen - 1991
2: Testing preorders for probabilistic processes (context) - Cleaveland, Smolka et al. - 1992
2: Compositional analysis of expected delays in networks of probabilistic I/O autom..
- Stark, Smolka - 1998
BibTeX entry: (Update)
R. Lanotte, A. Maggiolo-Schettini, and A. Troina. Weak Bisimulation for Probabilistic Timed Automata and Applications to Security. In Proc. SEFM'03, pages 34--43. IEEE, 2003. http://citeseer.ist.psu.edu/lanotte03weak.html More
@misc{ lanotte03weak,
author = "R. Lanotte and A. Maggiolo-Schettini and A. Troina",
title = "Weak Bisimulation for Probabilistic Timed Automata and Applications to
Security",
text = "R. Lanotte, A. Maggiolo-Schettini, and A. Troina. Weak Bisimulation for
Probabilistic Timed Automata and Applications to Security. In Proc. SEFM'03,
pages 34--43. IEEE, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/lanotte03weak.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
666
Theoretical Computer Science (context) - Alur, Dill - 1994
404
Symbolic Model Checking for Real-time Systems
- Henzinger, Nicollin et al. - 1994
72
Security Policy and Security Models (context) - Goguen, Meseguer - 1982
58
Springer-Verlag (context) - Halmos - 1950
36
Weak Bisimulation for Fully Probabilistic Processes
- Baier, Hermanns - 1994
28
On Algorithmic Verification methods for Probabilistic System.. (context) - Baier - 1998
28
Generative and Stratified Models of Probabilistic Processes (context) - van Glabbeek, Smolka et al. - 1995
25
Probabilistic NonRepudiation without Trusted Third Party
- Markowitch, Roggeman - 1999
21
Automatic Verification of Real-time Systems with Discrete Pr..
- Kwiatkowska, Norman et al. - 1999
9
Security Analysis of a Probabilistic Non-repudiation Protoco.. (context) - Aldini, Gorrieri - 2002
6
Timed Automata May Cause Some Troubles
- Bouyer
5
Symbolic Model Checking of Probabilistic Timed Automata Usin..
- Kwiatkowska, Norman et al.
2
On Probabilistic Timed Automata Theoretical Computer Science (context) - Beauquier - 2003
Documents on the same site (http://www.di.unipi.it/~troina/): More
Towards a Formal Treatment of Secrecy against.. - Troina, Aldini, Gorrieri (2004)
(Correct)
Automatic Analysis of the NRL Pump - Lanotte, Tini, Troina, Tronci (2004)
(Correct)
Message Equivalence and Imperfect Cryptography in a Formal.. - Troina, Aldini, Gorrieri (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC