Process Algebra Semantics of Parallel Object-Oriented Language (POOL)

摘要

It is shown that it is possible to give semantics of the POOL concurrent programming language by means of process algebra. The translation of POOL programs into process algebra is complicated, but this is mainly caused by the complexity of POOL. The attribute grammar used for the translation makes it possible to give the semantics in a modular way. An application of the algebra of communicating processes (ACP) where the sequential composition operator is used in full generality is outlined. Two auxiliary operators, the chaining operator and the state operator, are defined in terms of the operators of ACP tau + renaming and turn out to be useful.