Extending Communicating Sequential Processes (CSP) by preserving the distributivity laws for internal choice, in the presence of probabilistic choice, has been an open problem so far. The problem stems from a well known disagreement between probabilistic choice and nondeterministic choice, that raises congruence issues for parallel composition. Recently, it has been argued that the congruence issue can be resolved only by restricting the power of the schedulers that resolve the nondeterminism. In our previous work, we have restricted the schedulers by suitably labeling the nondeterministic transitions. We have defined a ready-trace equivalence and a parallel composition with hiding for which the equivalence is a congruence. In this paper, we generalize our model and give a CSP-style axiomatic characterization of the ready-trace equivalence. From the axiomatization it follows that all distributivity axioms for internal choice from CSP are preserved, and no new axioms are added.
|Title of host publication||Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance (16th International GI/ITG Conference, MMB & DFT 2012, Kaiserslautern, Germany, March 19-21, 2012. Proceedings)|
|Place of Publication||Berlin|
|Publication status||Published - 2012|
|Name||Lecture Notes in Computer Science|
Georgievska, S., & Andova, S. (2012). Probabilistic CSP: Preserving the laws via restricted schedulers. In J. B. Schmitt (Ed.), Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance (16th International GI/ITG Conference, MMB & DFT 2012, Kaiserslautern, Germany, March 19-21, 2012. Proceedings) (pp. 136-150). (Lecture Notes in Computer Science; Vol. 7201). Springer. https://doi.org/10.1007/978-3-642-28540-0_10