Parallel program design: a foundation
Parallel program design: a foundation
Nonsequential processes
Petri nets and algebraic specifications
Theoretical Computer Science
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
The existence of refinement mappings
Theoretical Computer Science
Selected papers of the 3rd workshop on Concurrency and compositionality
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Solution of a problem in concurrent programming control
Communications of the ACM
Distributed Algorithms
Should Concurrency be Specified?
Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems
Proving Correctness of Distributed Algorithms Using High-Level Petri Nets - A Case Study
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
A distributed algorithm is often used as a part of a larger distributed system. Usually, the properties of an algorithm are proven for the algorithm in isolation. Then, it is not obvious how the algorithm behaves when integrated into a larger system. In this paper, we present a simple technique which allows to derive properties of an algorithm which is integrated into a distributed system from the properties of the algorithm in isolation. The technique exploits the fact that some actions of a distributed algorithm do not belong to the algorithm but are triggered by the environment. If these actions are distinguished and are adequately considered in the verification of the algorithm, basically all properties are still valid for the algorithm as a part of a larger distributed system. This result will be formalized in the setting of the Distributed Algorithms' Working Notation (DAWN). Based on this result, we will give a proof rule which allows to prove liveness properties of a system from liveness properties of the involved distributed algorithm.