Lixi Zhou, Jiaqing Chen, et al.
VLDB
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 equivalence of two weakest precondition definitions, one with certain order preferences, and another one, preference-free, is shown. The representation of various operational concepts, including delay, is discussed. Several examples of applying the rules are given. © 1984.
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Leo Liberti, James Ostrowski
Journal of Global Optimization