JavaScript is disabled for your browser. Some features of this site may not work without it.
A Distributed Path Algorithm and Its Correctness Proof

Author
Wright, David D.; Schneider, Fred B.
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.
Date Issued
1983-06Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-556
Type
technical report