Modeling consensus in a process calculus.

DOI10.1007/B11938MaRDI QIDQ5900579zbMATH OpenOpenAlexFDO

Authors Uwe Nestmann, Rachele Fuzzati, Massimo Merro

Publication date 30 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11938

Mathematics Subject Classification ID

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

Recommendations

• Distributed consensus, revisited
• Much ado about nothing?
• In search of lost time
• Model checking Paxos in Spin
• The weakest failure detector for solving consensus

Cited in

(8)

• Process calculi as a tool for studying coordination, contracts and session types
• Distributed consensus, revisited
• A theory of system behaviour in the presence of node and link failure
• States in process calculi
• Store locally, prove globally
• An object based algebra for specifying a fault tolerant software architecture
• Much ado about nothing?
• A simple proof of a simple consensus algorithm

This page was built for publication: Modeling consensus in a process calculus.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900579)