Communicating sequential processes
Communicating sequential processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Detection of stable properties in distributed applications
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel program design: a foundation
Parallel program design: a foundation
A compositional approach to superimposition
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synchronization and control of distributed systems and programs
Synchronization and control of distributed systems and programs
Proof of distributed algorithms: an exercise
Developments in concurrency and communication
Topics in distributed algorithms
Topics in distributed algorithms
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Observing Global States of Asynchronous Distributed Applications
Proceedings of the 3rd International Workshop on Distributed Algorithms
A New Approach to Detection of Locally Indicative Stability
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
Distributed Evaluation: A Tool for Constructing Distributed Detection Programs
ISTCS'92 Proceedings of the Israel Symposium on Theory of Computing and Systems
Paradigms for Distributed Programs
Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985 Munich
Distributed Infimum Approximation
FCT '87 Proceedings of the International Conference on Fundamentals of Computation Theory
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
Detecting Arbitrary Stable Properties Using Efficient Snapshots
IEEE Transactions on Software Engineering
Computing, observing, controlling, checkpointing: symbiosis is even better than agreement!
DISC'09 Proceedings of the 23rd international conference on Distributed computing
| Hi-index | 0.00 |
Methodological design of distributed programs is necessary if one is to master the complexity of parallelism. The class of control programs, whose purpose is to observe or detect properties of an underlying program, plays an important role in distributed computing. The detection of a property generally rests upon consistent evaluations of a predicate; such a predicate can be global, i.e. involve states of several processes and channels of the observed program. Unfortunately, in a distributed system, the consistency of an evaluation cannot be trivially obtained. This is a central problem in distributed evaluations. This paper addresses the problem of distributed evaluation, used as a basic tool for solution of general distributed detection problems. A new evaluation paradigm is put forward, and a general distributed detection program is designed, introducing the iterative scheme of guarded waves sequence. The case of distributed termination detection is then taken to illustrate the proposed methodological design.