Show simple item record

dc.contributor.authorWright, David D.en_US
dc.contributor.authorSchneider, Fred B.en_US
dc.date.accessioned2007-04-23T16:47:59Z
dc.date.available2007-04-23T16:47:59Z
dc.date.issued1983-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-556en_US
dc.identifier.urihttps://hdl.handle.net/1813/6396
dc.description.abstractA 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.en_US
dc.format.extent725357 bytes
dc.format.extent189868 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Distributed Path Algorithm and Its Correctness Proofen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics