Detecting causal relationships in distributed computations: In search of the holy grail
type: Item
instance of: scholarly article
title: Detecting causal relationships in distributed computations: In search of the holy grail
zbMATH Open document ID: 0813.68096
DOI: 10.1007/BF02277859
author: Reinhard Schwarz
author: Friedemann Mattern
published in: Distributed Computing
publication date: 1994-08-29T00:00:00Z
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 625978
zbMATH Keywords: global predicate detection
zbMATH Keywords: distributed debugging
zbMATH Keywords: timestamps
zbMATH Keywords: distributed programs
zbMATH Keywords: causal relationships
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
cites work: Recording distributed snapshots based on causal order of message delivery
cites work: Concerning the size of logical clocks in distributed systems
cites work: Interval graphs and interval orders
cites work: Q3703299
cites work: Recovery in distributed systems using optimistic message logging and checkpointing
cites work: Interleaving set temporal logic
cites work: Verification of distributed programs using representative interleaving sequences
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: Global conditions in debugging distributed programs
cites work: Q4002642
cites work: Exploiting locality in maintaining potential causality
cites work: Petri nets, event structures and domains. I
cites work: Inevitability in concurrent systems
cites work: Concurrent common knowledge: Defining agreement for asynchronous systems
cites work: Modeling concurrency with partial orders
cites work: The causal ordering abstraction and a simple way to implement it
cites work: Q3814798
cites work: An efficient implementation of vector clocks
cites work: A Theorem on Boolean Matrices
description: scientific article; zbMATH DE number 625978