A process calculus with finitary comprehended terms

DOI10.1007/S00224-013-9468-XMaRDI QIDQ385508zbMATH OpenOpenAlexFDO

Authors C. A. Middelburg, J. A. Bergstra

Publication date 2 December 2013

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0903.2914

process calculus ACP process algebra comprehended term meadow enriched ACP process algebra variable-binding operator

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: We introduce the notion of an ACP process algebra and the notion of a meadow enriched ACP process algebra. The former notion originates from the models of the axiom system ACP. The latter notion is a simple generalization of the former notion to processes in which data are involved, the mathematical structure of data being a meadow. Moreover, for all associative operators from the signature of meadow enriched ACP process algebras that are not of an auxiliary nature, we introduce variable-binding operators as generalizations. These variable-binding operators, which give rise to comprehended terms, have the property that they can always be eliminated. Thus, we obtain a process calculus whose terms can be interpreted in all meadow enriched ACP process algebras. Use of the variable-binding operators can have a major impact on the size of terms.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: A process calculus with finitary comprehended terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385508)