Automatic construction of CSP programs from sequential non-deterministic programs
In this paper we describe a systematic method for transforming a sequential program, written in a guarded command laguage, 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.
- Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
- Distributing a class of sequential programs
- scientific article; zbMATH DE number 3997155
- Basic results in automatic transformations of shared memory parallel programs into sequential programs
- scientific article; zbMATH DE number 3911719
- Transformations for communication fairness in CSP
- Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)
- Basic results in automatic transformations of shared memory parallel programs into sequential programs
- Formal sequentialization of distributed systems via program rewriting
- Modeling the distributed termination convention of CSP
- scientific article; zbMATH DE number 4005586 (Why is no real title available?)
- Automated Generation of BSP Automata
This page was built for publication: Automatic construction of CSP programs from sequential non-deterministic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060002)
