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 and may equivalences and are proven to be congruences.
Since ν | oL =P P ∈supp(ν) ν(P )δP |OL, by Corollary 3, we have µ | oL ⇝ ν | oL ⇝ ν′ := X P ∈ψL∩supp(ν) ν(P )(ρP | δω) + X P ∈ψL∩supp(ν) ν(P )δP |OL
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Unifying Approach to Probabilistic Testing Equivalences
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 and may equivalences and are proven to be congruences.