dc.contributor.author Moitra, Abha en_US dc.date.accessioned 2007-04-23T16:50:44Z dc.date.available 2007-04-23T16:50:44Z dc.date.issued 1984-03 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-597 en_US dc.identifier.uri https://hdl.handle.net/1813/6437 dc.description.abstract In 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.extent 2263271 bytes dc.format.extent 568297 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript dc.language.iso en_US en_US dc.publisher Cornell University en_US dc.subject computer science en_US dc.subject technical report en_US dc.title Automatic Construction of CSP Programs from Sequential Non-Deterministic Programs en_US dc.type technical report en_US
﻿