24 search results - page 2 / 5 » concur 2003 |
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failur...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective procedure for testing if this condition holds of a given B...