A proof theory of asynchronously communicating sequential processes
نویسندگان
چکیده
منابع مشابه
Local Nondeterminism in Asynchronously Communicating Processes
In this paper we present a simple compositional Hoare logic for reasoning about the correctness of a certain class of distributed systems. We consider distributed systems composed of processes which interact asynchronously via unbounded FIFO buuers. The simplicity of the proof system is due to the restriction to local nondeterminism in the description of the sequential processes of a system. To...
متن کاملA Timed Model for Communicating Sequential Processes
The parallel language CSP [9], an earlier version of which was described in [7], has become a major tool for the analysis of structuring methods and proof systems involving parallelism. The significance of CSP is in the elegance by which a few simply stated constructs (e.g., sequential and parallel composition, nondeterministic choice, concealment, and recursion) lead to a language capable of e...
متن کاملA Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope with an indeterminate environment. We develop for the resulting parallel programming language, which subsumes deterministic data ow, a simple compositional proof system. Reasoning about communication and synchronization ...
متن کاملDeconstructing CCS and CSP Asynchronous Communication, Fairness, and Full Abstraction
The process algebras CCS and CSP assume that processes interact by means of handshake communication, although it would have been equally reasonable to have adopted asynchronous communication as primitive. Traditional semantics of CCS (based on bisimulation) and CSP (such as the failures model) do not assume fair parallel composition, although fairness is often vital in ensuring liveness propert...
متن کاملCSP Revisited
In this paper we revisit the formalization of Communicating Sequential Processes (CSP) [2] in Isabelle/HOL. We offer a simple alternative embedding of this specification language for distributed processes that makes use of as many standard features of the underlying Higher Order Logic of Isabelle, like datatypes and the formalization of fixpoints due to Tarski.
متن کامل