CCS for Trees
نویسندگان
چکیده
CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel composition which is parameterized by a graph at the vertices of which subprocesses are located. Communication is allowed only between subprocesses related by an edge in this graph. We define an observational equivalence based on barbs as well as weak bisimilarity equivalence and prove an adequacy theorem relating these two notions.
منابع مشابه
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in the sense of weak bisimilarity, to its causal transition system in CCS. This can be used to develop an efficient method for designing distributed algorithms, which we illustrate here by deriving a distributed algorithm fo...
متن کاملOn the Relationship of CCS and CSP
This paper compares two models of concurrency, Milner's Calculus of Communicating Systems (CCS) and the failures model of Communicating Sequential Processes (CSP) developed by Hoare, Brookes and Roscoe. By adapting Milner's synchronisation trees to serve as notation for both CCS and CSP, we are able to define a representation mapping for CSP processes. We define an equivalence relation on synch...
متن کاملA Fully Abstract Semantics for Value-passing CCS for Trees
This paper provides a fully abstract semantics for valuepassing 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 barbe...
متن کاملEvent Structure Semantics for CCS and Related Languages
We give denotational semantics to a wide range of parallel programming languages based on the idea of Milner’s CCS [Mil80a], that processes communicate by events of mutual synchronization. Processes are denoted by labeled event structures. Event structures represent concurrency rather directly, as in net theory [Bra80]. The semantics does not simulate concurrency by non-deterministic interleavi...
متن کاملOutline of a Denotational Semantics for the π-Calculus
It appears possible to give a fairly standard denotational semantics for the π-calculus, provided that we work within a functor category indexed by a category I of finite sets and injections. The construction is driven by the expansion law, and resembles Abramsky’s domain of synchronisation trees [1]. It also extends Ingólfsdóttir’s work on domain models of value-passing CCS [4]. The relevant p...
متن کاملAlgebraic Synchronization Trees and Processes
We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1306.1714 شماره
صفحات -
تاریخ انتشار 2013