Beyond Lamport's Happened-before

DOI10.1145/2542181MaRDI QIDQ3189648zbMATH OpenOpenAlexFDO

Authors Ido Ben-Zvi, Yoram Moses

Publication date 12 September 2014

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2542181

zbMATH Keywords

coordinationdistributed computingknowledgereal-time systemstemporal order

Mathematics Subject Classification ID

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

Recommendations

• Beyond Lamport's happened-before: on the role of time bounds in synchronous systems
• scientific article; zbMATH DE number 3903950
• scientific article; zbMATH DE number 1286115
• Time, clocks, and the ordering of events in a distributed system
• Vector time and causality among abstract events in distributed computations
• Bounded time-stamping in message-passing systems
• Partial order techniques for distributed discrete event systems: why you cannot avoid using them
• An algorithm for exact bounds on the time separation of events in concurrent systems

Cites work

• A course in game theory.
• A theory of clock synchronization (extended abstract)
• Agent-time epistemics and coordination
• Agreeing to disagree
• Beyond Lamport's happened-before: on the role of time bounds in synchronous systems
• Dynamic epistemic logic
• How processes learn
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 65756 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 3359806 (Why is no real title available?)
• Knowledge and common knowledge in a distributed environment
• Knowledge, probability, and adversaries
• Knowledge, timed precedence and clocks (preliminary report)
• Levels of knowledge in distributed systems.
• New directions in cryptography
• On interactive knowledge with bounded communication
• Real-time systems. Design principles for distributed embedded applications.
• The Knowledge Complexity of Interactive Proof Systems
• The topological structure of asynchronous computability
• Time, clocks, and the ordering of events in a distributed system

Cited in

(12)

• Valency-based consensus under message adversaries without limit-closure
• Optimistically tuning synchronous Byzantine consensus: another win for null messages
• Partial order techniques for distributed discrete event systems: why you cannot avoid using them
• Known unknowns: time bounds and knowledge of ignorance
• Asynchronous message orderings beyond causality
• Beyond Lamport's happened-before: on the role of time bounds in synchronous systems
• A datalog-based computational model for coordination-free, data-parallel systems
• Relating knowledge and coordinated action: the knowledge of preconditions principle
• Causality and epistemic reasoning in Byzantine multi-agent systems
• On using time without clocks via zigzag causality
• Fire!
• Topological characterization of consensus in distributed systems

This page was built for publication: Beyond Lamport's Happened-before

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