Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A constructive proof for FLP

From MaRDI portal
Publication:834901
Jump to:navigation, search

DOI10.1016/J.IPL.2004.06.008zbMath1173.68392OpenAlexW2100506359MaRDI QIDQ834901

Hagen Völzer

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.008


zbMATH Keywords

distributed systemsfault tolerancedistributed computingconcurrencyconsensus problemformal modelling


Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)


Related Items (1)

Mechanical Verification of a Constructive Proof for FLP




Cites Work

  • Impossibility of distributed consensus with one faulty process




This page was built for publication: A constructive proof for FLP

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:834901&oldid=12773458"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 13:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki