A process calculus with finitary comprehended terms

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.

25 pages, combined with arXiv:0901.3012 [math.RA]; presentation improved, mistakes in Table 5 corrected

References in corpus (12)

• Cancellation Meadows: a Generic Basis Theorem and Some Applications
• Instruction sequences with indirect jumps
• Projection semantics for rigid loops
• Thread extraction for polyadic instruction sequences
• Interface groups and financial transfer architectures
• Inversive Meadows and Divisive Meadows
• Instruction sequences and non-uniform complexity theory
• Tuplix Calculus Specifications of Financial Transfer Networks
• Transmission protocols for instruction streams
• A process calculus with finitary comprehended terms
• Meadow enriched ACP process algebras
• The structure of finite meadows

Cited by in corpus (5)

• Transformation of fractions into simple fractions in divisive meadows
• Division by zero in non-involutive meadows
• Imperative process algebra with abstraction
• Using Hoare logic in a process algebra setting
• A process calculus with finitary comprehended terms