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 is formalized in terms of input/output variables which record for each bu er the sequence of values sent and received. These input/output variables provide an abstraction of the usual notion of history variables which denote sequences of communication events. History variables are in general necessary for compositional reasoning about the correctness of distributed systems composed of non-deterministic 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...
متن کاملOn Test Case Generation from Asynchronously Communicating State Machines
This paper proposes an approach for generating test cases in Concurrent TTCN from a system of asynchronously communicating nite state machines. We give an algorithm for generating a noninterleaving model of prime event structures from a generalized model of asynchronously communicating nite state machines and deal with the generation of test cases from prime event structures.
متن کاملProbabilistic Communicating Processes
We explore the suitability of two semantic spaces as a basis for a probabilistic variant of the language of Communicating Sequential Processes (UP), so as to provide a formalism for the specification and proof of correctness of probabilistic algorithms. The two spaces give rise to two sublanguages, each of which is characterised by an algebraic axiomatisation which is shown to be sound and comp...
متن کامل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...
متن کامل