A process calculus with finitary comprehended terms

Details A process calculus with finitary comprehended terms A process calculus with finitary comprehended terms

2009-03-17

arxiv.org/abs/0903.2914v2

Computer Science

Logic in Computer Science

22 pages, combined with arXiv:0901.3012 [math.RA]

Scientific paper

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, 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.

Affiliated with

Also associated with

No associations

Rating

A process calculus with finitary comprehended terms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A process calculus with finitary comprehended terms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A process calculus with finitary comprehended terms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491159