329 search results - page 36 / 66 » Asynchronous Communication in Process Algebra |
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we propose an attention-based vision system for the JAST interactive dialog robot. The robotic vision system incorporates three submodules: object recognition, gestu...
WISES
2003
13 years 9 months ago
2003
— More and more fieldbus applications require a communication with real-time properties, while still being economically feasible. The fieldbuses LIN and TTP/A take this require...
CONCUR
1997
Springer
13 years 12 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...