Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs) (Q1104075)

For the specification of distributed algorithms CSP has gained a great deal of interest. This tendency arises from the fact that the semantic definition of the most important control structures already refers to global conditions (e.g., distributed termination convention, I/O-guards, failure). These conceptions are very powerful but hard to implement. Now our approach presents a complete transformation system to map any CSP-program into a version which is easily implementable. The textual manipulations are carried out by the stepwise application of transformations which are composable corresponding to their domains. Their codomains are equivalent and normalized CSP-programs.