Probabilistic automata (PA) are a prominent compositional concurrency model. As a way to justify property-preserving abstractions, in the last years, bisimulation relations over probability distributions have been proposed both in the strong and the weak setting. Different to the usual bisimulation relations, which are defined over states, an algorithmic treatment of these relations is inherently hard, as their carrier set is uncountable, even for finite PAs. The coarsest of these relation, weak distribution bisimulation, stands out from the others in that no equivalent state-based characterisation is known so far. This paper presents an equivalent state-based reformulation for weak distribution bisimulation, rendering it amenable for algorithmic treatment. Then, decision procedures for the probability distribution-based bisimulation relations are presented.
|Title of host publication||Quantitative Evaluation of Systems : 10th International Conference, QEST 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings|
|Publication status||Published - 2013|
|Event||10th International Conference on Quantitative Evaluation of SysTems (QEST 2013) - Buenos Aires, Argentina|
Duration: 27 Aug 2013 → 30 Aug 2013
|Conference||10th International Conference on Quantitative Evaluation of SysTems (QEST 2013)|
|Period||27/08/2013 → 30/08/2013|
|Series||Lecture Notes in Computer Science|