Communication-closed asynchronous protocols
A Damian, C Drăgoi, A Militaru, J Widder - … , CAV 2019, New York City, NY …, 2019 - Springer
The verification of asynchronous fault-tolerant distributed systems is challenging due to
unboundedly many interleavings and network failures (eg, processes crash or message …
unboundedly many interleavings and network failures (eg, processes crash or message …
Reducing asynchrony to synchronized rounds
A Damien, C Dragoi, A Militaru, J Widder - arXiv preprint arXiv:1804.07078, 2018 - arxiv.org
Synchronous computation models simplify the design and the verification of fault-tolerant
distributed systems. For efficiency reasons such systems are designed and implemented …
distributed systems. For efficiency reasons such systems are designed and implemented …
Derivation of Heard-Of predicates from elementary behavioral patterns
A Shimi, A Hurault, P Queinnec - … Components, and Systems: 40th IFIP WG …, 2020 - Springer
There are many models of distributed computing, and no unifying mathematical framework
for considering them all. One way to sidestep this issue is to start with simple communication …
for considering them all. One way to sidestep this issue is to start with simple communication …
The splendors and miseries of rounds
A Shimi - ACM SIGACT News, 2019 - dl.acm.org
Take a stroll with me through the distributed computing literature: we could scour the
proceedings of PODC, DISC, SIROCCO, OPODIS, and more; we could explore the issues of …
proceedings of PODC, DISC, SIROCCO, OPODIS, and more; we could explore the issues of …
[PDF][PDF] Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models
A Shimi, A Hurault, P Quéinnec - Logical Methods in Computer …, 2021 - lmcs.episciences.org
In distributed computing, multiple processes interact to solve a problem together. The main
model of interaction is the message-passing model, where processes communicate by …
model of interaction is the message-passing model, where processes communicate by …
On the Power of Rounds: Explorations of the Heard-Of Model
A Shimi - 2020 - hal.science
Distributed computing differs from sequential computing mainly through its abundance of
incomparable models. Whereas everything goes back to Turing machines in sequential …
incomparable models. Whereas everything goes back to Turing machines in sequential …