A Distributed Path Algorithm and Its Correctness Proof
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
A distributed program is developed to allow a process in a network to determine a path from itself to any other process, assuming that the topology of the entire network is not known to any process and that each process knows only the names of the processes to which it is directly connected. The solution, written in CSP, is proved correct and deadlock-free.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1983-06
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-556
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report