FINITE PROCESS ALGEBRAS

Abstract

\(PA_{\varepsilon}\) algebras are structures of specific importance for parallel processing. They are the basis for mathematical representation of the idea of parallel computation through the formalisms of the process algebras.

The number of equations (axioms) that the elements of those algebras have to satisfy increase as their signatures are getting augmented in order to gain more expressive power. However, all of them retain the three basic properties: commutativity, associativity and idempotency of their additive operation. That makes it possible to describe and analyse them as semilattices.

This paper presents some properties of these structures that can simplify, in the case of finite cardinality, their automatic generation.