an:05817534
Zbl 1208.68160
Lanotte, Ruggero; Maggiolo-Schettini, Andrea; Troina, Angelo
Weak bisimulation for probabilistic timed automata
EN
Theor. Comput. Sci. 411, No. 50, 4291-4322 (2010).
00270037
2010
j
68Q85 68Q45
probabilistic timed automata; weak bisimulation
Summary: We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of probabilistic timed automata and introduce a concept of weak bisimulation for these automata, together with an algorithm to decide it. The weak bisimulation relation is shown to be preserved when either time, or probability is abstracted away. As an application, we use weak bisimulation for probabilistic timed automata to model and analyze a timing attack on the dining cryptographers protocol.