Much ado about nothing?

DOI10.1016/J.ENTCS.2005.12.082zbMATH Open1316.68207OpenAlexW4254255512MaRDI QIDQ5262962FDOQ5262962

Uwe Nestmann, Rachele Fuzzati

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.082

Recommendations

• Modeling consensus in a process calculus.
• Distributed consensus, revisited
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
• An algebra of processes
• States in process calculi

zbMATH Keywords

verificationdistributed algorithmsprocess calculi

Mathematics Subject Classification ID

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

Cites Work

• Unreliable failure detectors for reliable distributed systems
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• CONCUR 2003 - Concurrency Theory

Cited In (7)

• Much Ado about Zero
• Distributed event algebras
• Algebraic specification and proof of a distributed recovery algorithm
• Title not available (Why is that?)
• Much ado about nothing
• Title not available (Why is that?)
• More ado about nothing

This page was built for publication: Much ado about nothing?

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