A Mathematical Model and Refinement Relation for a CSP-Like Language
Luming Lai · Open Scholarship Institutional Repository (Washington University in St. Louis) · 1990
In this paper we present a mathematical model for CSP-like language. This model handles both safety and liveness properties of "purely parallel" CSP processes, as well as CSP processes with internal machine states. A refinement order is defined in this model which is a combination of the refinement order in CSP's failure model and the refinement order for sequential programs. Finally, related work and applications are discussed.