Two normal form theorems for CSP programs (Q1094869)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4026812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two normal form theorems for CSP programs |
scientific article; zbMATH DE number 4026812 |
Statements
Two normal form theorems for CSP programs (English)
0 references
1987
0 references
We define two normal forms for CSP programs. In the first normal form, each process contains only one I/O repetitive command and all its I/O commands appear as guards of this command. In the second normal form, all guards of this I/O repetitive command are I/O guards. We describe an inductive method that transforms any CSP program into an equivalent program in first or second normal form. The notion of equivalence is discussed. It is shown that no transformation into second normal form can preserve deadlock freedom.
0 references
partially interpreted computation
0 references
syntactic equivalence
0 references
deadlock freedom
0 references
0.8531019687652588
0 references
0.7413458824157715
0 references
0.7411904335021973
0 references
