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
In higher-order process calculi, the values exchanged in communications may contain processes. A cor...
This paper studies causality in the ß-calculus. Our notion of causality combines the dependencies gi...
We propose a methodology for the analysis of open systems based on process calculi and bisimilarity....
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
The paper investigates a concurrent computation model, chi calculus, in which communications resembl...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
. We propose a fully parallel calculus of synchronizing processes. The calculus was deeply inspired...
AbstractBisimulation expresses the equivalence of processes whose external actions are identical. So...
Proposes a typed calculus of synchronous processes based on the structure of interaction categories....
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
In concurrency, processes can be studied using a partial order or an interleaving semantics. In part...
AbstractIn higher-order process calculi, the values exchanged in communications may contain processe...
AbstractA calculus for distributed computation is studied, based upon four combinators. A central id...
In higher-order process calculi, the values exchanged in communications may contain processes. A cor...
This paper studies causality in the ß-calculus. Our notion of causality combines the dependencies gi...
We propose a methodology for the analysis of open systems based on process calculi and bisimilarity....
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
The paper investigates a concurrent computation model, chi calculus, in which communications resembl...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a fi...
. We propose a fully parallel calculus of synchronizing processes. The calculus was deeply inspired...
AbstractBisimulation expresses the equivalence of processes whose external actions are identical. So...
Proposes a typed calculus of synchronous processes based on the structure of interaction categories....
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurr...
In concurrency, processes can be studied using a partial order or an interleaving semantics. In part...
AbstractIn higher-order process calculi, the values exchanged in communications may contain processe...
AbstractA calculus for distributed computation is studied, based upon four combinators. A central id...
In higher-order process calculi, the values exchanged in communications may contain processes. A cor...
This paper studies causality in the ß-calculus. Our notion of causality combines the dependencies gi...
We propose a methodology for the analysis of open systems based on process calculi and bisimilarity....