The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define another branching bisimulation in the more general model allowing consecutive probabilistic transitions, and we prove that it is compatible with parallel composition. We then show that our bisimulation is actually the coarsest congruence relation included in the existing branching bisimulation when restricted to the alternating model.
|Title of host publication||Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages (QAPL 2008, Budapest, Hungary, March 29-30, 2008)|
|Editors||A. Aldini, C. Baier|
|Publication status||Published - 2008|
|Name||Electronic Notes in Theoretical Computer Science|