Probabilistic CSP: Preserving the Laws via Restricted Schedulers
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.
KeywordsNormal Form Internal Transition Probabilistic Choice Parallel Composition Communicate Sequential Process
Unable to display preview. Download preview PDF.
- 10.Georgievska, S.: Probability and Hiding in Concurrent Processes. PhD thesis, Eindhoven University of Technology (2011)Google Scholar
- 13.Georgievska, S., Andova, S.: Probabilistic CSP: Preserving the laws via restricted schedulers. Technical Report (2011), http://www.win.tue.nl/~sgeorgie/axioms2011_long.pdf
- 14.Giro, S., D’Argenio, P.: On the expressive power of schedulers in distributed probabilistic systems. In: QAPL 2009. ENTCS, vol. 253(3), pp. 45–71 (2009)Google Scholar
- 18.Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)Google Scholar
- 19.Kwiatkowska, M., Norman, G.: A testing equivalence for reactive probabilistic processes. In: EXPRESS 1998. ENTCS, vol. 16(2), pp. 1–19 (1998)Google Scholar
- 20.Kwiatkowska, M.Z., Norman, G.J.: A fully abstract metric-space denotational semantics for reactive probabilistic processes. In: COMPROX 1998. ENTCS, vol. 13, pp. 1–33 (1998)Google Scholar
- 22.Lindley, D.V.: Introduction to Probability and Statistics from a Bayesian Viewpoint. Cambridge University Press (1980)Google Scholar
- 23.Lowe, G.: Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93, Oxford University Computing Labs (1993)Google Scholar
- 27.Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall (1998)Google Scholar
- 28.Segala, R.: Modeling and Verification of Randomized Distributed Real-time Systems. PhD thesis, MIT (1995)Google Scholar
- 30.Wang, Y., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII, pp. 47–61 (1992)Google Scholar