Sciweavers

329 search results - page 39 / 66
» Asynchronous Communication in Process Algebra
Sort
View
JSS
1998
90views more  JSS 1998»
15 years 4 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp
POPL
1999
ACM
15 years 9 months ago
Types for Mobile Ambients
An ambient is a named cluster of processes and subambients, which moves as a group. We describe type systems able to guarantee that certain ambients will remain immobile, and that ...
Luca Cardelli, Andrew D. Gordon
MKM
2009
Springer
15 years 11 months ago
OpenMath in SCIEnce: SCSCP and POPCORN
In this short communication we want to give an overview of how OpenMath is used in the European project “SCIEnce” [12]. The main aim of this project is to allow unified commun...
Peter Horn, Dan Roozemond
WETICE
2005
IEEE
15 years 10 months ago
Evaluation of an awareness distribution mechanism: A simulation approach
In distributed software engineering, the role of informal communication is frequently overlooked. Participants simply employ their own ad-hoc methods of informal communication. Co...
David Nutter, Cornelia Boldyreff
137
Voted
IFIP
2004
Springer
15 years 10 months ago
The Driving Philosophers
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
Sébastien Baehni, Roberto Baldoni, Rachid G...