2016/07/01 by Shichao Liu, Liu, Shichao, Thomas Ehrhard +3
Computer Science · #Distributed systems and fault tolerance #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.1607.00141
arXiv admin note: substantial text overlap with arXiv:1512.00550
arxiv created 2016/07/01 · openalex publication_date 2016/07/01 · arxiv updated 2016/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.