Pith. sign in

REVIEW 1 cited by

Analyzing Divergence for Nondeterministic Probabilistic Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.00491 v2 pith:I55Y2CLL submitted 2024-03-01 cs.LO

Analyzing Divergence for Nondeterministic Probabilistic Models

classification cs.LO
keywords probabilisticbisimilaritiesbranchingequivalenceweakbehavioraldivergencedivergence-sensitive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Unifying Approach to Probabilistic Testing Equivalences

    cs.LO 2025-07 unverdicted novelty 6.0

    A unifying framework for probabilistic testing equivalences is introduced via distribution-based semantics and process predicates, yielding internal and external characterizations that generalize classical fair/should...