Sciweavers

329 search results - page 28 / 66
» Asynchronous Communication in Process Algebra
Sort
View
FOSSACS
2009
Springer
13 years 11 months ago
The Calculus of Handshake Configurations
Handshake protocols are asynchronous protocols that enforce several properties such as absence of transmission interference and insensitivity from delays of propagation on wires. W...
Luca Fossati, Daniele Varacca
AMAST
1995
Springer
13 years 11 months ago
A Calculus of Countable Broadcasting Systems
In this paper we propose a process algebra named CCB (a Calculus of Countable Broadcasting Systems). We define an observational congruence relation in CCB after basic definitions...
Yoshinao Isobe, Yutaka Sato, Kazuhito Ohmaki
WDAG
2010
Springer
196views Algorithms» more  WDAG 2010»
13 years 6 months ago
Brief Announcement: Failure Detectors Encapsulate Fairness
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
FOSSACS
2009
Springer
14 years 2 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
TCS
2008
13 years 7 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous