Happened-before

Known as: Happened before, Lamport, Lamport ordering 
In computer science, the happened-before relation (denoted: ) is a relation between the result of two events, such that if one event should happen… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The coordination of a sequence of actions, to be performed in a linear temporal order in a distributed system, is studied. While… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 9
Is this relevant?
2011
2011
Temporal uncertainty in raw data can impede the inference of temporal and causal relationships between events and compromise the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 3
Is this relevant?
2010
2010
Lamport’s Happened-before relation is fundamental to coordinating actions in asynchronous systems. Its role is less dominant in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Alert fusion is a process that analyzes the alerts produced by one or more intrusion detection systems and provides a more… (More)
  • table 2
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper presents a new methodology to perform passive testing based on invariants. This novel approach is supported by the… (More)
  • figure 1
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2002
2002
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1998
1998
The happened before model has been widely used to model distributed computations In particular it has been used to model the… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Consistent global snapshots are important in many distributed applications. We prove the exact conditions for an arbitrary… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This paper presents results on the complexity of computing event orderings for sharedmemory parallel program executions. Given a… (More)
  • table 1
  • figure 1
Is this relevant?
1990
1990
A diverse group of software engineers flew down to A.ustin about a year ago at the invitation of The National Research Council’s… (More)
Is this relevant?