Notes on Markovian Extension of a Dialect of Value Passing CCS

Many calculi for Service Oriented Computing (SOC) are based on a two-party, CCS-like, communication paradigm. In the context of SOC architectures, code mobility and dynamic process creation will play a major role, especially in distributed environments. In this framework, properties like commutativity and associativity of parallel composition operators is highly desirable. In this note we show how a relevant subset of CCS with value passing can be extended with stochastic information in such a way that associativity and commutativity of process parallel compositions is preserved, in the sense that P|(Q|R) is strong Markovian bisimilar to (P|Q)|R.