108 search results - page 2 / 22 » Approximate Synchrony: An Abstraction for Distributed Almost... |
CORR
2011
Springer
13 years 9 days ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
EMSOFT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract This paper is sort of a confession. Issues of synchrony, asynchrony, and synchronization, arise frequently in designing embedded systems from components, like everyone I k...
TC
2002
13 years 5 months ago
2002
Abstract-- Current systems are very often based on largescale, unpredictable and unreliable infrastructures. However, users of these systems increasingly require services with time...
CONCUR
2012
Springer
11 years 7 months ago
2012
Springer
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
ISAAC
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...