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

zbMATH Open0646.68032MaRDI QIDQ1104075FDOQ1104075

Authors: Dieter Zöbel 

Publication date: 1988

Published in: Informatik. Forschung und Entwicklung (Search for Journal in Brave)

Recommendations

• Two normal form theorems for CSP programs
• Automatic construction of CSP programs from sequential non-deterministic programs
• Transformations for communication fairness in CSP
• scientific article; zbMATH DE number 3911719
• A transformation system for concurrent processes

zbMATH Keywords

CSPdistributed algorithmsprogram transformationdistributed termination conventionI/O-guardsimplementation in PROLOGnormal form transformations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cited In (9)

• Transformations for communication fairness in CSP
• Two normal form theorems for CSP programs
• Fifty years of Hoare's logic
• Unfolding CSP
• Design and verification of fault tolerant systems with CSP
• Modeling the distributed termination convention of CSP
• Automatic construction of CSP programs from sequential non-deterministic programs
• Finite-state concurrent programs can be expressed in pairwise normal form
• Finite-state concurrent programs can be expressed succinctly in triple normal form

This page was built for publication: Normalform-Transformationen für CSP-Programme. (Normal form transformations for CSP-programs)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104075)