Title: Weak bisimulation for probabilistic timed automata and applications to security
Abstract: 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.
Publication Year: 2003
Publication Date: 2003-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 24
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot