Publication View

A process calculus with finitary comprehended terms (2009)

Abstract
Meadow enriched ACP process algebras are essentially enrichments of models of the axiom system ACP that concern processes in which data are involved, the mathematical structure of data being a meadow. For all associative operators from the signature of meadow enriched ACP process algebras, 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 that bind variables with a two-valued range can already have a major impact on the size of terms.. Comment: 21 pages

Publication details
Download http://arxiv.org/abs/0903.2914
Repository arXiv (United States)
Keywords Computer Science - Logic in Computer Science, D.1.3, F.1.2, F.4.1
Type text