A non-interleaving process calculus for multi-party synchronisation

Details A non-interleaving process calculus for multi-party synchronisation A non-interleaving process calculus for multi-party synchronisation

2009-12-03

arxiv.org/abs/0912.0555v1

EPTCS 12, 2009, pp. 87-98

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.12.6

We introduce the wire calculus. Its dynamic features are inspired by Milner's CCS: a unary prefix operation, binary choice and a standard recursion construct. Instead of an interleaving parallel composition operator there are operators for synchronisation along a common boundary and non-communicating parallel composition. The (operational) semantics is a labelled transition system obtained with SOS rules. Bisimilarity is a congruence with respect to the operators of the language. Quotienting terms by bisimilarity results in a compact closed category.

Affiliated with

Also associated with

No associations

Rating

A non-interleaving process calculus for multi-party synchronisation 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 non-interleaving process calculus for multi-party synchronisation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A non-interleaving process calculus for multi-party synchronisation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-516585