Algebra of communicating processes with abstraction


Jan A. Bergstra, Jan Willem Klop

Theoretical Computer Science 37, pages 77121,  1985

<div>We present an axiom system ACP, for communicating processes with silent actions (‘&tau;-steps’). The system is an extension of ACP, Algebra of Communicating Processes, with Milner's &tau;-laws and an explicit abstraction operator. By means of a model of finite acyclic process graphs for ACP<sub>&tau;</sub>, syntactic properties such as consistency and conservativity over ACP are proved. Furthermore, the Expansion Theorem for ACP is shown to carry over to ACP<sub>&tau;</sub>. Finally, termination of rewriting terms according to the ACP<sub>&tau;</sub>, axioms is probed using the method of recursive path orderings.</div>

 @article{commproc-tcs37,
Author = {Bergstra, Jan A. and Klop, Jan Willem},
Doi = {10.1016/0304-3975(85)90088-X},
Issn = {0304-3975},
Journal = {Theoretical Computer Science},
Pages = {77--121},
Title = {Algebra of communicating processes with abstraction},
Url = {http://www.sciencedirect.com/science/article/pii/030439758590088X},
Volume = 37,
Year = 1985

Tags:

Publication

— authors

Jan A. Bergstra, Jan Willem Klop

— status

published

— sort

article in journal

Venue

— journal

Theoretical Computer Science

— volume

37

— pages

77121

— publication date

1985

URLs

original page

Identifiers

— DOI

10.1016/0304-3975(85)90088-X

— print ISSN

0304-3975

BibTeX

— BibTeX ID
commproc-tcs37
— BibTeX category
article

Partita IVA: 01131710376 - Copyright © 2008-2022 APICe@DISI Research Group - PRIVACY