Weak bisimulation for probabilistic timed automata and applications to security

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.

[1]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[2]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[3]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[4]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[5]  Roberto Gorrieri,et al.  Security Analysis of a Probabilistic Non-repudiation Protocol , 2002, PAPM-PROBMIV.

[6]  R. Segala,et al.  Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

[9]  Richard S. Varga,et al.  Proof of Theorem 5 , 1983 .

[10]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

[11]  Danièle Beauquier.  On probabilistic timed automata , 2003, Theor. Comput. Sci..

[12]  Patricia Bouyer,et al.  Timed Automata May Cause Some Troubles , 2002 .

[13]  Marta Kwiatkowska,et al.  Symbolic Model Checking of Probabilistic Timed Automata Using Backwards Reachability , 2000 .

[14]  Olivier Markowitch,et al.  Probabilistic Non-Repudiation without Trusted Third Party , 1999 .