Journal ArticleDOI
On Lamport's interprocessor communication model
TLDR
The extent to which Leslie Lamport's axiom system differs from systems based on “atomic,” or indivisible, actions is determined.Abstract:
Leslie Lamport presented a set of axioms in 1979 that capture the essential properties of the temporal relationships between complex and perhaps unspecified activities within any system, and proceeded to use this axiom system to prove the correctness of sophisticated algorithms for reliable communication and mutual exclusion in systems without shared memory. As a step toward a more complete metatheory of Lamport's axiom system, this paper determines the extent to which that system differs from systems based on “atomic,” or indivisible, actions. Theorem 1 shows that only very weak conditions need be satisfied in addition to the given axioms to guarantee the existence of an atomic “model,” while Proposition 1 gives sufficient conditions under which any such model must be a “faithful” representation. Finally, Theorem 2 restates a result of Lamport showing exactly when a system can be thought of as made up of a set of atomic events that can be totally ordered temporally. A new constructive proof is offered for this result.read more
Citations
More filters
Journal ArticleDOI
How to make a correct multiprocess program execute correctly on a multiprocessor
TL;DR: A method is proposed for deriving the necessary commands from a correctness proof of the underlying algorithm in a formalism based on temporal relations among operation executions to synchronize memory accesses.
Proceedings Article
Structure of Concurrency
Ryszard Janicki,Maciej Koutny +1 more
TL;DR: In this paper, the authors propose a model for concurrency with three levels of abstraction: the observation level, invariant level and system level, and they proceed from the bottom (observation) level to the top (system) level.
Book ChapterDOI
Time, logic and computation
TL;DR: A clear continuity of logical concerns emerges between philosophy, linguistics and computer science, and the latter adds several new themes and perspectives which might well give it a significant impact on the earlier standard enterprise.
Journal ArticleDOI
Fundamentals of modelling concurrency using discrete relational structures
Ryszard Janicki,Maciej Koutny +1 more
TL;DR: For a number of different classes of structures, it is shown that any structure can be represented as the intersection of its maximal extensions, which can be seen as a generalisation of Szpilrajn's theorem.
Journal ArticleDOI
Point algebras for temporal reasoning: algorithms and complexity
Mathias Broxvall,Peter Jonsson +1 more
TL;DR: A new time model suitable for reasoning about systems with a bounded number of unsynchronized clocks is presented, connections with spatial reasoning are investigated, and improved algorithms for deciding satisfiability of the tractable point algebras are presented.
References
More filters
Journal ArticleDOI
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Guarded commands, nondeterminacy and formal derivation of programs
TL;DR: So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state.