We gratefully acknowledge support from
the Simons Foundation
and member institutions
Full-text links:

Download:

Current browse context:

math

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo ScienceWISE logo

Computer Science > Logic in Computer Science

Title: 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.
Comments: 25 pages, combined with arXiv:0901.3012 [math.RA]; presentation improved, mistakes in Table 5 corrected
Subjects: Logic in Computer Science (cs.LO); Rings and Algebras (math.RA)
ACM classes: D.1.3; F.1.2; F.4.1
Journal reference: Theory of Computing Systems, 53(4):645--668, 2013
DOI: 10.1007/s00224-013-9468-x
Cite as: arXiv:0903.2914 [cs.LO]
  (or arXiv:0903.2914v3 [cs.LO] for this version)

Submission history

From: Kees Middelburg [view email]
[v1] Tue, 17 Mar 2009 07:19:00 GMT (34kb)
[v2] Tue, 29 Mar 2011 10:46:34 GMT (30kb)
[v3] Thu, 28 Mar 2013 11:55:20 GMT (32kb)