12 search results - page 2 / 3 » Abstracting Cryptographic Protocols with Tree Automata |
200
Voted
TCS
2010
15 years 1 months ago
2010
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 ...
182
Voted
CONCUR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
153
Voted
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
193
Voted
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
216
click to vote
ACOM
2006
Springer
16 years 11 days ago
2006
Springer
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...