Trace Analysis for Conformance and Arbitration Testing
IEEE Transactions on Software Engineering
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
On the Construction of Submodule Specifications and Communication Protocols
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Formal verification of parallel programs
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Reduction: a method of proving properties of parallel programs
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Fundamental Tehoerem of Asynchronous Parallel Computation
Proceedings of the Sagamore Computer Conference on Parallel Processing
Synchronization with eventcounts and sequencers (Extended Abstract)
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Process synchronization by counter variables
ACM SIGOPS Operating Systems Review
Automatic detection of errors in distributed systems
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
Hi-index | 0.00 |
Methods of limiting the impact of communication delays on the logical behavior of distributed systems are considered. It is assumed that a distributed system is described in terms of a number of interconnected modules, and each module is described in terms of its possible states and the possible state transitions. Transitions may be initiated spontaneously by a module and may give rise to output messages, which will be received, after some possible delay, by another module as an input. Otherwise, transitions may be initiated by received input. If the system has the property called regularity, its behavior is logically independent of the communication delays. A simple condition for regularity is given. This condition is the basis for the implementation of counter-based synchronization conditions in a distributed environment. Weaker forms of regularity, which make abstraction of internal operations invisible from the point of view of an outside observer, are also considered. The application of these concepts to the design of module interfaces involving 'collisions' and to communication including timeouts is discussed in some detail with examples.