Table of Contents
Fetching ...

Analyzing Divergence for Nondeterministic Probabilistic Models

Hao Wu, Yuxi Fu, Huan Long, Xian Xu, Wenbo Zhang

TL;DR

This paper addresses divergence sensitivity in probabilistic nondeterministic models by comparing branching and weak bisimulation refinements that account for divergence. It introduces two divergence-sensitive notions for RCCS_fs: branching bisimulation with explicit divergence ($\simeq^{\Delta}$) and exhaustive branching bisimulation ($\simeq_{e}$), each capturing different divergence aspects via divergent $\epsilon$-trees and maximal $\tau$-ECs, respectively. The authors establish a lattice of relations among these variants, showing, for example, that $\simeq^{\Delta} \subsetneq \simeq_{e} \subsetneq \simeq \subsetneq \approx$ and that $\simeq_{e} \subseteq \approx_{e}$, with strict separations demonstrated by concrete examples. They provide polynomial-time algorithms for all divergence-sensitive notions, including DetDivTree, DivBranBisim, ExhBranBisim, and ExhWeakBisim, and demonstrate how distribution-based and $\epsilon$-tree based semantics can be related algorithmically. The work advances practical verification of divergence-sensitive probabilistic processes and suggests broad applicability to other probabilistic models and future axiomatizations.

Abstract

Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several divergence-sensitive refinements of branching and weak probabilistic bisimilarities have been proposed in the literature. Both the definitions of these equivalences and the techniques to investigate them differ significantly. This paper presents a comprehensive comparative study on divergence-sensitive behavioral equivalence relations that refine the branching and weak probabilistic bisimilarities. Additionally, these equivalence relations are shown to have efficient checking algorithms. The techniques of this paper might be of independent interest in a more general setting.

Analyzing Divergence for Nondeterministic Probabilistic Models

TL;DR

This paper addresses divergence sensitivity in probabilistic nondeterministic models by comparing branching and weak bisimulation refinements that account for divergence. It introduces two divergence-sensitive notions for RCCS_fs: branching bisimulation with explicit divergence () and exhaustive branching bisimulation (), each capturing different divergence aspects via divergent -trees and maximal -ECs, respectively. The authors establish a lattice of relations among these variants, showing, for example, that and that , with strict separations demonstrated by concrete examples. They provide polynomial-time algorithms for all divergence-sensitive notions, including DetDivTree, DivBranBisim, ExhBranBisim, and ExhWeakBisim, and demonstrate how distribution-based and -tree based semantics can be related algorithmically. The work advances practical verification of divergence-sensitive probabilistic processes and suggests broad applicability to other probabilistic models and future axiomatizations.

Abstract

Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several divergence-sensitive refinements of branching and weak probabilistic bisimilarities have been proposed in the literature. Both the definitions of these equivalences and the techniques to investigate them differ significantly. This paper presents a comprehensive comparative study on divergence-sensitive behavioral equivalence relations that refine the branching and weak probabilistic bisimilarities. Additionally, these equivalence relations are shown to have efficient checking algorithms. The techniques of this paper might be of independent interest in a more general setting.
Paper Structure (16 sections, 30 theorems, 8 equations, 14 figures, 1 table)

This paper contains 16 sections, 30 theorems, 8 equations, 14 figures, 1 table.

Key Result

Lemma 2.12

If $\{\mathcal{E}_i\}_{i \in I}$ is a collection of branching bisimulations, then $\mathcal{E} = (\bigcup_{i \in I} \mathcal{E}_i)^{*}$ is also a branching bisimulation.

Figures (14)

  • Figure 1: Examples of systems with different divergence behaviors.
  • Figure 2: LTS for $\mathrm{RCCS}_{fs}$.
  • Figure 3: Example of $\epsilon$-trees.
  • Figure 4: pLTS for $\mathrm{RCCS}_{fs}$.
  • Figure 5: Counterexamples of the inclusion relationship.
  • ...and 9 more figures

Theorems & Definitions (76)

  • Example 2.1
  • Example 2.2
  • Definition 2.3: $\epsilon$-tree fu_ModelIndependentApproach_2021
  • Definition 2.4: Regular and divergent $\epsilon$-tree fu_ModelIndependentApproach_2021
  • Example 2.5
  • Definition 2.6: $\ell$-transition fu_ModelIndependentApproach_2021
  • Example 2.7
  • Definition 2.8: $q$-transition fu_ModelIndependentApproach_2021
  • Example 2.9
  • Definition 2.10: Branching bisimulation fu_ModelIndependentApproach_2021
  • ...and 66 more