Weak bisimulation for Probabilistic Timed Automata |
| |
Authors: | Ruggero Lanotte |
| |
Affiliation: | a Dipartimento di Informatica e Comunicazione, Università dell’Insubria, Via Carloni 78, 22100 Como, Italyb Dipartimento di Informatica - Università di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italyc Dipartimento di Informatica - Università di Torino, Corso Svizzera 185, 10149 Torino, Italy |
| |
Abstract: | 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. |
| |
Keywords: | Probabilistic timed automata Weak bisimulation |
本文献已被 ScienceDirect 等数据库收录! |
|