From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm

Wil Janssen, W.P.M. Janssen, Jakob Zwiers

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

17 Citations (Scopus)
35 Downloads (Pure)

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].
Original languageUndefined
Title of host publication11th Annual ACM Symposium on Principles of Distributed Computing
Place of PublicationVancouver
PublisherAssociation for Computing Machinery (ACM)
Pages215-227
Number of pages13
ISBN (Print)9780897914956
DOIs
Publication statusPublished - 10 Aug 1992

Publication series

Name
PublisherACM

Keywords

  • IR-101739
  • METIS-119894

Cite this

Janssen, W., Janssen, W. P. M., & Zwiers, J. (1992). From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm. In 11th Annual ACM Symposium on Principles of Distributed Computing (pp. 215-227). Vancouver: Association for Computing Machinery (ACM). https://doi.org/10.1145/135419.135461
Janssen, Wil ; Janssen, W.P.M. ; Zwiers, Jakob. / From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm. 11th Annual ACM Symposium on Principles of Distributed Computing. Vancouver : Association for Computing Machinery (ACM), 1992. pp. 215-227
@inproceedings{2054134969c04494bc971b9a6186277e,
title = "From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm",
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].",
keywords = "IR-101739, METIS-119894",
author = "Wil Janssen and W.P.M. Janssen and Jakob Zwiers",
year = "1992",
month = "8",
day = "10",
doi = "10.1145/135419.135461",
language = "Undefined",
isbn = "9780897914956",
publisher = "Association for Computing Machinery (ACM)",
pages = "215--227",
booktitle = "11th Annual ACM Symposium on Principles of Distributed Computing",
address = "United States",

}

Janssen, W, Janssen, WPM & Zwiers, J 1992, From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm. in 11th Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery (ACM), Vancouver, pp. 215-227. https://doi.org/10.1145/135419.135461

From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm. / Janssen, Wil; Janssen, W.P.M.; Zwiers, Jakob.

11th Annual ACM Symposium on Principles of Distributed Computing. Vancouver : Association for Computing Machinery (ACM), 1992. p. 215-227.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm

AU - Janssen, Wil

AU - Janssen, W.P.M.

AU - Zwiers, Jakob

PY - 1992/8/10

Y1 - 1992/8/10

N2 - 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].

AB - 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].

KW - IR-101739

KW - METIS-119894

U2 - 10.1145/135419.135461

DO - 10.1145/135419.135461

M3 - Conference contribution

SN - 9780897914956

SP - 215

EP - 227

BT - 11th Annual ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery (ACM)

CY - Vancouver

ER -

Janssen W, Janssen WPM, Zwiers J. From Sequential Layers to Distributed Processes, Deriving a minimum weight spanning tree algorithm. In 11th Annual ACM Symposium on Principles of Distributed Computing. Vancouver: Association for Computing Machinery (ACM). 1992. p. 215-227 https://doi.org/10.1145/135419.135461