CONCUR
2003
Springer
14 years 7 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
CONCUR
2003
Springer
14 years 7 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 7 months ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
CONCUR
2003
Springer
14 years 7 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 7 months ago
2003
Springer
CONCUR
2003
Springer
14 years 7 months ago
2003
Springer
traction for HOPLA Mikkel Nygaard1 and Glynn Winskel2 1 BRICS , University of Aarhus 2 Computer Laboratory, University of Cambridge A fully abstract denotational semantics for the ...
CONCUR
2003
Springer
14 years 7 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 7 months ago
2003
Springer
Abstract. Digital signal processing and control (DSPC) tools allow application developers to assemble systems by connecting predefined components in signal–flow graphs and by h...
CONCUR
2003
Springer
14 years 7 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 7 months ago
2003
Springer
We establish that on the domain of probabilistic automata, the trace distribution precongruence coincides with the simulation preorder.