Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs

DOI10.1016/J.TCS.2024.114794MaRDI QIDQ6614029

François Taïani, Davide Frey, Lucie Guillou, Michel Raynal

Publication date: 7 October 2024

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

zbMATH Keywords

distributed algorithmByzantine fault toleranceMazurkiewicz tracesconflict-free replicated data types

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asynchronous byzantine agreement protocols
• Deterministic asynchronous automata for infinite traces
• The consensus number of a cryptocurrency
• The weakest failure detector for eventual consistency
• 'Cause I'm strong enough: reasoning about consistency choices in distributed systems
• The Bitcoin Backbone Protocol: Analysis and Applications
• Scheduling multithreaded computations by work stealing
• Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Time is not a healer
• Causal memory: definitions, implementation, and programming
• Fault-Tolerant Message-Passing Distributed Systems
• Laws of order
• Asynchronous Byzantine reliable broadcast with a message adversary
• Scalable Byzantine reliable broadcast

This page was built for publication: Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs

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