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.
By Corollary 3 (2), there exists µ1, µ2 such that µ′−µ′(P L)δP L 1−µ′(P L) ⇝ µ1, ρ ⇝ µ2, and νj = (1 − µ′(P L))µ1 + µ′(P L)µ2
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.