A branching bisimulation for probabilistic systems that is preserved under parallel composition has been defined recently for the alternating model. We show that besides being compositional, it is decidable in polynomial time and it preserves the properties expressible in probabilistic Computation Tree Logic (pCTL). In the ground-complete axiomatization, only a single axiom is added to the axioms for strong bisimulation. We show that the Concurrent Alternating Bit protocol can be verified using the process algebra and a set of recursive rules.
|Title of host publication||SOFSEM 2009 : Theory and Practice of Computer Science (35th Conference, Spindleruv Mlyn, Czech Republic, January 24-30, 2009, Proceedings)|
|Editors||M. Nielsen, A. Kucera, P.B. Miltersen, C. Palamidessi, P. Tuma, F. Valencia|
|Place of Publication||Berlin|
|Publication status||Published - 2009|
|Name||Lecture Notes in Computer Science|