A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)

DOI10.1007/978-3-540-71316-6_27zbMath1187.68326OpenAlexW1528448306MaRDI QIDQ5756509

Adrian Francalanza, Matthew C. B. Hennessy

Publication date: 4 September 2007

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71316-6_27

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Related Items (4)

Fault-tolerant multiparty session types ⋮ Distributed consensus, revisited ⋮ A theory of system behaviour in the presence of node and link failure ⋮ Formal Model–Driven Design of Distributed Algorithms

This page was built for publication: A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)