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.
When |π1| = k + 1, we can divide the transition sequence into µ1 π′ 1 − − →ν′ 1 τ − − →ν1, where π1 = π′ 1 ◦ τ and π′ 1 is a degenerate witness
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.