Weak bisimulation for Probabilistic Timed Automata

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, bility are 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.

• Type: Journal
• Year: 2010
• Where: TCS
• Authors: Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
• Keywords: Probabilistic Timed Automata, TCS 2010, Theoretical Computer Science, Weak Bisimulation, Weak Bisimulation Relation