Towards parallelization of concurrent systems

A Distribution Law for CCS and a New Congruence Result for the pi-calculus

“…In this sense, our work is close to [6], where the notion of maximally parallel process in CCS (with choice) is studied. [6] defines a rewriting process through which maximally parallel normal forms can be computed, and shows that in the case of µCCS, such normal forms are unique.…”

“…Section 5 presents the proof of our congruence result in the π-calculus, and we give concluding remarks in Sect. 6. This paper is an extended version of [9].…”

Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics

“…In [4], cancellation with respect parallel composition was first proved and exploited to prove the completeness of an axiomatisation of distributed bisimilarity. Unique parallel decomposition could be of practical interest too, e.g., to devise methods for finding the maximally parallel implementation of a behaviour [6], or for improving verification methods [11].…”

A Distribution Law for CCS and a New Congruence Result for the π-Calculus

“…In this sense, our work is close to [5], where the notion of maximally parallel process in CCS (with choice) is studied. [5] defines a rewriting process through which maximally parallel normal forms can be computed, and shows that in the case of μCCS, such normal forms are unique.…”

“…In this sense, our work is close to [5], where the notion of maximally parallel process in CCS (with choice) is studied. [5] defines a rewriting process through which maximally parallel normal forms can be computed, and shows that in the case of μCCS, such normal forms are unique. However, no syntactical characterisation of the set of normal forms is presented, and such a characterisation cannot be directly deduced from the (rather involved) definition of the rewriting process for full CCS.…”