On Inductive Characterization for Divergence-sensitive Probabilistic Branching Bisimilarity

Key Points

• The research aims to establish an inductive characterization for divergence-sensitive branching bisimilarity in probabilistic settings.
• Developed an equivalent inductive characterization for the branching bisimilarity.
• Explored the relationship between probabilistic and non-probabilistic models.
• Proposed a polynomial-time verification algorithm based on the new characterization.
• Successfully established an inductive characterization for the divergence-sensitive branching bisimilarity.
• Introduced a verification algorithm that operates within polynomial time.