From sequential layers to distributed processes: deriving a distributed minimum weight spanning tree algorithm
Wil Janssen,Job Zwiers +1 more
- 01 Oct 1992
- pp 215-227
TL;DR: A framework is introduced that allows for a formal treatment of the design process, from an abstract initial design to an implementation tailored to specific architectures, by deriving an implementation of a distributed minimum weight spanning tree algorithm in the style of [GHS].
read more
Abstract: Analysis and design of distributed algorithms and protocols are difficult issues. An important cause for those difficulties is the fact that the logical structure of the solution is often invisible in the actual implementation. We introduce a framework that allows for a formal treatment of the design process, from an abstract initial design to an implementation tailored to specific architectures. A combination of algebraic and axiomatic techniques is used to verify correctness of the derivation steps. This is shown by deriving an implementation of a distributed minimum weight spanning tree algorithm in the style of [GHS].
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Layering of real-time distributed processes
Wil Janssen,Mannes Poel,Q. Xu,Jakob Zwiers +3 more
- 19 Sep 1994
TL;DR: An assertional proof system is proposed for a shared variable language extended with real-time constructs and synchronization, and a layering operator that combines algebraic and assertional reasoning.
32
A Principle for Sequential Reasoning about Distributed Algorithms
F. A. Stomp,W. R Roever +1 more
TL;DR: A principle for formally designing and verifying large classes of algorithms, such as those for computing minimum-paths, connectivity, network flow, and minimum-weight spanning trees, is presented.
29
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract)
Parosh Aziz Abdulla,Bengt Jonsson,Mats Kindahl,Mats Kindahl,Doron Peled +4 more
- 28 Jun 1998
TL;DR: The purpose of partial-order reduction techniques is to avoid exploring several interleavings of independent transitions when model checking the temporal properties of a concurrent system as mentioned in this paper, which is the purpose of Partial-Order Reduction techniques.
An Algebraic Semantics for Message Sequence Chart Documents
Thomas Gehrke,Michaela Huhn,Arend Rensink,Heike Wehrheim +3 more
- 03 Nov 1998
TL;DR: In this article, a process algebraic semantics for basic MSCs including conditions, enabling the formal interpretation of entire MSC documents, is given, which covers the complete language of single MSC, but lacks an interpretation for conditions which are used as continuation points of MCSs within an MSC document.
Partial Order Based Design of Concurrent Systems
Job Zwiers,Wil Janssen +1 more
- 01 Jan 1993
TL;DR: A partial order based graph model for concurrency is introduced, using hierarchical structured graphs with relations denoting concurrency, causal ordering, and temporal ordering to obtain a powerful calculus that allows to algebraically transform processes or to prove properties of them.
17
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
On the shortest spanning subtree of a graph and the traveling salesman problem
Joseph B. Kruskal
- 01 Feb 1956
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
4.9K
•Book
Concurrency Control and Recovery in Database Systems
Philip A. Bernstein,Vassco Hadzilacos,Nathan Goodman +2 more
- 01 Feb 1987
TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.
4.2K
•Book
Data Structures and Network Algorithms
Robert E. Tarjan
- 01 Jan 1983
TL;DR: This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
2.3K