Probabilistic weak bisimulation and axiomatization for probabilistic models

Abstract

Recently a branching bisimilarity congruence has been established for randomized process models in a model independent approach. In this paper, we propose a probabilistic weak bisimilarity for randomized CCS based on the notion of weak ϵ-tree and show that it is a congruence. We also provide a complete axiomatization for the finite fragment of the language. Both the definition of weak bisimilarity and the proof of congruence respect model independency and thus can be easily generalized to a randomized extension of any interactive model.