A Process Algebra Featuring Action Refinement

Masaki ITOH

IEICE TRANSACTIONS (1976-1990)   Vol.E73    No.11    pp.1880-1885
Publication Date: 1990/11/25
Online ISSN: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Automaton, Language and Theory of Computing

Full Text: PDF>>
Buy this Article

A process algebra dACP based on differential equivalence (d-equivalence) and the algebra ACP by Bergstra et al. is proposed. The features of dACP are as follows:
・Real parallelism can be distiguished from action interleaving.
・Action refinement is possible under d-equivalence.
Thus, dACP resolves the difficulties of ACP caused by the atomicity of actions assumed in ACP. After defining dACP, d-equivalence is shown to imply the original equivalence defined in ACP. Next, it is shown that action refinement can be introduced in a natural way under d-equivalence.