Show simple item record

dc.contributor.authorMoitra, Abhaen_US
dc.date.accessioned2007-04-23T16:50:44Z
dc.date.available2007-04-23T16:50:44Z
dc.date.issued1984-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-597en_US
dc.identifier.urihttps://hdl.handle.net/1813/6437
dc.description.abstractIn this paper we describe a systematic method for transforming a sequential program, written in a guarded command language, into a distributed program, written in CSP. The variables of the sequential program are first partitioned into $n$ disjoint sets, and then the program is transformed into a CSP program of $n$ communicating processes. The two versions of the program are shown to be strongly equivalent, in the sense that they exhibit the properties of reaching the same final states and of either aborting, terminating, or running forever. We also discuss the conditions under which, when compared to the execution of the original sequential program, a speed-up in the execution of the resulting distributed program can be achieved.en_US
dc.format.extent2263271 bytes
dc.format.extent568297 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.titleAutomatic Construction of CSP Programs from Sequential Non-Deterministic Programsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics