Sciweavers

246 search results - page 7 / 50
» A Proof System for Asynchronously Communicating Deterministi...
Sort
View
108
Voted
LICS
2008
IEEE
15 years 6 months ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
82
Voted
EMSOFT
2007
Springer
15 years 3 months ago
Necessary and sufficient conditions for deterministic desynchronization
Synchronous reactive formalisms associate concurrent behaviors to precise schedules on global clock(s). This allows a non-ambiguous notion of "absent" signal, which can ...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
85
Voted
FSEN
2009
Springer
15 years 6 months ago
A Timed Calculus for Wireless Systems
We propose a timed process calculus for wireless systems exposed to communication collisions. The operational semantics of our calculus is given in terms of a labelled transition ...
Massimo Merro, Eleonora Sibilio
70
Voted
OPODIS
2004
15 years 1 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
106
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
15 years 12 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...