|Title:||A Weakest Precondition Semantics for Communicating Processes
|Authors:||Tzilla Elrad and Nissim Francez
|Abstract:||A weakest precondition semantics for communicating processes is presented, based on a centralized one level approach. Semantic equations are given for the CSP constructs and their continuity is proved. The representation of various operationl concepts, including delay, is discussed. Several examples of applying the rules are given.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1982/CS/CS0244), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1982
To the main CS technical reports page
Computer science department, Technion