We investigate concurrency of probabilistic systems in the alternating model. So far two different merge operators that capture two different views how concurrent probabilistic processes may interleave have been proposed. We show that neither of these operators is compositional with respect to weak probabilistic bisimulation for the alternating model. Currently, we work on defining a variant of a merge operator that will preserve weak bisimulation. We present the basic points of our research in this presentation.
|Title of host publication||Proceedings 18th Nordic Workshop on Programming Theory (NWPT'06, Reykjavik, Iceland, October 18-20, 2006)|
|Publication status||Published - 2006|