Weak bisimulation for probabilistic timed automata and applications to security

Proceedings - 1st International Conference on Software Engineering and Formal Methods, SEFM 2003

Volumn , Issue , 2003, Pages 34-43

  Lanotte, R ^a   Maggiolo Schettini, A ^a   Troina, A ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORMAL METHODS; TIME SHARING SYSTEMS;

NON-REPUDIATION PROTOCOL; PROBABILISTIC BEHAVIOR; PROBABILISTIC TIMED AUTOMATA; TIMED SYSTEMS; WEAK BISIMULATION;

SOFTWARE ENGINEERING;

MODELS; SIMULATION;

EID: 11344249122     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2003.1236205     Document Type: Conference Paper

References (14)

1. Aldini, A., Gorrieri, R.: Security Analysis of a Probabilistic Non-repudiation Protocol. In Proc. of PAPM-PROBMIV '02, Springer LNCS 2399, 17-36, 2002.
2. Alur, R., Dill, D. L.: A theory of timed automata. Theoretical Computer Science 126, 183-235, 1994.
3. Baier, C., Hermanns, H.: Weak Bisimulation for Fully Probabilistic Processes. Theoretical Computer Science 126, 183-235, 1994.
4. Baier, C: On Algorithmic Verification methods for Probabilistic Systems. Habilitation thesis, Univ. Mannheim, 1998.
5. Beauquier, D.: On Probabilistic Timed Automata Theoretical Computer Science 292, 2003, 65-84.
6. Bouyer, P.: Timed Automata May Cause Some Troubles. BRICS RS-02-35.
7. Goguen, J. A., Meseguer, J.: Security Policy and Security Models. In Proc. of IEEE Symp. on Security and Privacy, IEEE CS Press, 11-20, 1982.
8. van Glabbeek, R.J, Smolka, S.A., Steffen, R.: Reactive, Generative and Stratified Models of Probabilistic Processes. Information and Computation, 121, 1995, 59-80.
9. Halmos, P. R.: Measure Theory. Springer-Verlag, 1950.
10. Henzinger, T. A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model Checking for Real-time Systems. Information and Computation 111 (1994), 193-244.
11. Kwiatkowska, M, Norman, G, Segala, R, Sproston, J.: Automatic Verification of Real-time Systems with Discrete Probability Distribution. ARTS'99, LNCS 1601, 1999, 75-95.
12. Kwiatkowska, M, Norman, R, Sproston, J.: Symbolic Model Checking of Probabilistic Timed Automata Using Backwards Reachability. Tech. rep. CSR-00-01, University of Birmingham.
13. Markowitch, O., Roggeman, Y.: Probabilistic Non-Repudiation without Trusted Third Party. 2nd Conference on Security in Communication Network, 1999.
14. Milner, R.: Communication and Concurrency. Prentice Hall, 1989.