A Mathematical Model and Refinement Relation for a CSP-Like Language

Authors

Luming Lai, Washington University in St Louis
Jeff Sanders, Oxford University

Document Type

Technical Report

Publication Date

1990-06-28

Filename

WUCS-90-25.pdf

Technical Report Number

WUCS-90-25

Abstract

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.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7D21VZX

Recommended Citation

Lai, Luming and Sanders, Jeff, "A Mathematical Model and Refinement Relation for a CSP-Like Language" Report Number: WUCS-90-25 (1990). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/700