Sciweavers

CONCUR
2003
Springer
13 years 11 months ago
Priority Rewrite Systems for OSOS Process Languages
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...
Irek Ulidowski
CONCUR
2003
Springer
13 years 11 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
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...
Alin Stefanescu, Javier Esparza, Anca Muscholl
CONCUR
2003
Springer
13 years 11 months ago
A Process-Algebraic Language for Probabilistic I/O Automata
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...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
CONCUR
2003
Springer
13 years 11 months ago
Modeling Consensus in a Process Calculus
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...
Uwe Nestmann, Rachele Fuzzati, Massimo Merro
CONCUR
2003
Springer
13 years 11 months ago
Netcharts: Bridging the gap between HMSCs and executable specifications
Madhavan Mukund, K. Narayan Kumar, P. S. Thiagaraj...
CONCUR
2003
Springer
13 years 11 months ago
Full Abstraction for HOPLA
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 ...
Mikkel Nygaard, Glynn Winskel
CONCUR
2003
Springer
13 years 11 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
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 ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
CONCUR
2003
Springer
13 years 11 months ago
A Compositional Semantic Theory for Synchronous Component-based Design
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...
Barry Norton, Gerald Lüttgen, Michael Mendler
CONCUR
2003
Springer
13 years 11 months ago
Model Checking a Path
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” ...
Nicolas Markey, Ph. Schnoebelen
CONCUR
2003
Springer
13 years 11 months ago
Compositionality for Probabilistic Automata
We establish that on the domain of probabilistic automata, the trace distribution precongruence coincides with the simulation preorder.
Nancy A. Lynch, Roberto Segala, Frits W. Vaandrage...