A Fully Abstract Semantics for Value-passing CCS for Trees

TL;DR

This paper introduces a fully abstract, non-sequential semantics for value-passing CCS for trees, enabling better modeling of concurrent distributed systems with tree structures.

Contribution

It develops a novel non-sequential labelled transition semantics and proves the equivalence of weak barbed congruence and weak bisimilarity for image-finite processes.

Findings

Weak barbed congruence coincides with weak bisimilarity on image-finite processes

First such result for a concurrent model with tree structures

Examples demonstrate applicability to distributed systems

Abstract

This paper provides a fully abstract semantics for value-passing CCS for trees (VCCTS). The operational semantics is given both in terms of a reduction semantics and in terms of a labelled transition semantics. The labelled transition semantics is non-sequential, allowing more than one action occurring simultaneously. We develop the theory of behavioral equivalence by introducing both weak barbed congruence and weak bisimilarity. In particular, we show that weak barbed congruence coincides with weak bisimilarity on image-finite processes. This is the first such result for a concurrent model with tree structures. Distributed systems can be naturally modeled by means of this graph-based system, and some examples are given to illustrate this.