Bounded time-stamping in message-passing systems

DOI10.1016/S0304-3975(01)00329-2zbMath1018.68003OpenAlexW2153596823MaRDI QIDQ1853588

Yanyan Li

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00329-2

zbMATH Keywords

message-passing systemsfinite-state systemsbounded time-stampinglabeled partial orders

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ Synthesis of Safe Message-Passing Systems ⋮ A theory of regular MSC languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous mappings and asynchronous cellular automata
• The causal ordering abstraction and a simple way to implement it
• A theory of regular MSC languages
• Notes on finite asynchronous automata
• Time, clocks, and the ordering of events in a distributed system
• Keeping track of the latest gossip in a distributed system

This page was built for publication: Bounded time-stamping in message-passing systems