Time, clocks, and the ordering of events in a distributed system

Lamport, Leslie

doi:10.1145/359545.359563

Cited by 6,959 publications

(3,871 citation statements)

References 2 publications

Supporting

Mentioning

3,740

Contrasting

Unclassified

Order By: Relevance

“…In this paper, we choose the classic Lamport's event graph [10]. Lamport introduced event graphs (or event traces) as a representation for the semantics of message-passing programs.…”

Section: Lamport's Graph Modelmentioning

confidence: 99%

Rely-Guarantee Based Reasoning for Message-Passing Programs

Lei¹,

Qiu²

2014

SACS

View full text Add to dashboard Cite

The difficulties of verifying concurrent programs lie in their inherent non-determinism and interferences. Rely-Guarantee reasoning is one useful approach to solve this problem for its capability in formally specifying inter-thread interferences. However, modern verification requires better locality and modularity. It is still a great challenge to verify a message-passing program in a modular and composable way.In this paper, we propose a new reasoning system for messagepassing programs. It is a novel logic that supports Hoare style triples to specify and verify distributed programs modularly. We concretize the concept of event traces to represent interactions among distributed agents, and specify behaviors of agents by their local traces with regard to environmental assumptions -an idea inspired by Rely-Guarantee reasoning. Based on trace semantics, the verification is compositional in both temporal and spatial dimensions. To show validity, we apply our logic to modularly prove several examples.

show abstract

“…In this paper, we choose the classic Lamport's event graph [10]. Lamport introduced event graphs (or event traces) as a representation for the semantics of message-passing programs.…”

Section: Lamport's Graph Modelmentioning

confidence: 99%

Rely-Guarantee Based Reasoning for Message-Passing Programs

Lei¹,

Qiu²

2014

SACS

View full text Add to dashboard Cite

show abstract

“…Therefore a testing framework for MAS needs additional mechanisms to be able to properly sort the different events independently from the computer local clock. A way of achieving this independence is, for example, by using logical clocks (Lamport, 1978); this was used in Serrano and Botia (2009).…”

Section: Related Workmentioning

confidence: 99%

A generic testing framework for agent-based simulation models

Gürcan

Dikenelli

Bernon³

2013

Journal of Simulation

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Agent-based modelling and simulation (ABMS) had an increasing attention during the last decade. However, the weak validation and verification of agent-based simulation models makes ABMS hard to trust. There is no comprehensive tool set for verification and validation of agent-based simulation models, which demonstrates that inaccuracies exist and/or reveals the existing errors in the model. Moreover, on the practical side, many ABMS frameworks are in use. In this sense, we designed and developed a generic testing framework for agent-based simulation models to conduct validation and verification of models. This paper presents our testing framework in detail and demonstrates its effectiveness by showing its applicability on a realistic agent-based simulation case study.

show abstract

“…No two invocations have the same round number, and all the invocations can be totally ordered using a lexicographical order: (sn1, i) < (sn2, j) if ((sn1 < sn2) _ (sn1 ¼ sn2^i < j)). Lamport's logical clocks can generate 'close' sequence numbers [16]. (This can allow the leader to catch up quicker a higher round.…”

Section: Consensus With Infinitely Many Processesmentioning

confidence: 99%

“…The goal of Paxos is actually to implement highly available deterministic services despite faulty processes. Paxos is based on the well-known state machine approach [16] (also called active replication): the service is replicated over a set of processes, and every replica is supposed to compute every request and return the associated result to the corresponding client (which selects the first returned result). It is crucial to Paxos that the replicas deliver client's requests in the same total order.…”

Section: Introductionmentioning

confidence: 99%

The Alpha of Indulgent Consensus

Guerraoui¹,

Raynal²

2006

The Computer Journal

View full text Add to dashboard Cite

This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus algorithms. Key to the framework is a new abstraction we introduce here, called Alpha, and which precisely captures consensus safety. Implementations of Alpha in shared memory, storage area network, message passing and active disk systems are presented, leading to directly derived consensus algorithms suited to these communication media. The paper also considers the case where the number of processes is unknown and can be arbitrarily large.

show abstract

Time, clocks, and the ordering of events in a distributed system

Cited by 6,959 publications

References 2 publications

Rely-Guarantee Based Reasoning for Message-Passing Programs

Rely-Guarantee Based Reasoning for Message-Passing Programs

A generic testing framework for agent-based simulation models

The Alpha of Indulgent Consensus

Contact Info

Product

Resources

About