Bounded time-stamping in message-passing systems
type: Item
instance of: scholarly article
title: Bounded time-stamping in message-passing systems
zbMATH Open document ID: 1018.68003
DOI: 10.1016/S0304-3975(01)00329-2
author: Yanyan Li
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 1857113
zbMATH Keywords: message-passing systems
zbMATH Keywords: bounded time-stamping
zbMATH Keywords: labeled partial orders
zbMATH Keywords: finite-state systems
MaRDI profile type: Publication
cites work: Q3804201
cites work: Asynchronous mappings and asynchronous cellular automata
cites work: A theory of regular MSC languages
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: Q4385544
cites work: Keeping track of the latest gossip in a distributed system
cites work: Q4375802
cites work: Q4941891
cites work: The causal ordering abstraction and a simple way to implement it
cites work: Notes on finite asynchronous automata
full work available at URL: s0304-3975(01)00329-2
OpenAlex ID: W2153596823
description: scientific article; zbMATH DE number 1857113