- The paper unifies threshold-based behavioural distances through monotone predicate liftings and connects them to quantitative lax extensions, including the Lévy–Prokhorov distance for probabilistic systems.
- The authors introduce codensity games whose least-fixpoint winning regions are computable in polynomial time when legal moves are efficiently solvable, covering probabilistic, fuzzy, and metric transition systems.
- The framework extracts two-valued and quantitative distinguishing formulae with quadratic modal rank and quartic DAG size, under finite branching, while excluding expectation-based Kantorovich distances and leaving unrestricted branching open.
This paper develops a coalgebraic framework for threshold-based behavioural distances: distances defined as the infimum over all ϵ such that two states are related by an ϵ-relaxed (bi-)simulation. The prototypical instance is the ϵ-distance of Desharnais et al. on labelled Markov chains, recently shown to coincide with the distance induced by the Lévy–Prokhorov metric on distributions (2602.12084). The framework is parametrized over a set functor F and a set Λ of monotone $2$-to-V predicate liftings — natural transformations 2−⇒VFop that lift two-valued predicates to quantitative ones valued in the unit interval V=[0,1] — and covers both symmetric pseudometrics (when Λ is closed under duals) and asymmetric hemimetrics.
Threshold-based simulations and lax extensions
An ϵ0-ϵ1-simulation between coalgebras ϵ2 and ϵ3 is a relation ϵ4 such that whenever ϵ5, then ϵ6 for all ϵ7 and ϵ8. The induced behavioural distance ϵ9 is the infimum over admissible ϵ0. The paper's first structural result identifies this distance with the one induced by an explicitly constructed quantitative lax extension ϵ1, defined via thresholded cuts of ϵ2-valued relations; in the probabilistic case this extension is precisely the Lévy–Prokhorov lifting, so the framework recovers both one-sided and two-sided characterizations of ϵ3-distance on labelled Markov chains. Notably, the framework subsumes Hausdorff-type distances on metric transition systems and fuzzy transition systems, but explicitly excludes Kantorovich-type distances on probabilistic systems, which arise from expectation modalities rather than probability-evaluation modalities.
A technical caveat is stated plainly: the equivalence of ϵ4 with ϵ5-similarity requires finite branching. Without it, the property fails — the paper gives a counterexample over ϵ6 where states at distance ϵ7 are not ϵ8-similar. All expressiveness results below therefore carry this finite-branching assumption.
Codensity games and strategy computation
The authors introduce a Spoiler–Duplicator safety game for ϵ9-similarity, in the style of codensity games. Spoiler challenges a claimed similarity by exhibiting predicates F0 witnessing F1; Duplicator must reply with a pair F2 with F3, F4. Duplicator wins position F5 iff F6 (over finitely branching coalgebras). Spoiler's winning region is a least fixpoint computable by Kleene iteration in polynomial time, provided F7 satisfies a polynomial-time solvability condition: deciding, given functor elements and a relation, whether a legal Spoiler move exists, and computing one if so. This condition is verified for all running examples — Lévy–Prokhorov distance via max-flow/min-cut on the flow network of Desharnais et al., its labelled variant for generative probabilistic transition systems, and supremum-based modalities for fuzzy and metric transition systems (where checking singletons suffices).
The paper defines a two-valued logic F8 with threshold-indexed modalities F9 and a notion of satisfaction up to Λ0 (Λ1 iff Λ2). A key lemma shows that logical inclusion up to Λ3 can be checked at satisfaction level Λ4 alone, via a Λ5-relaxation operation on formulae. The main expressiveness theorem states that over finitely branching coalgebras, Λ6 iff Λ7 logically Λ8-simulates Λ9; hence any pair at distance strictly above $2$0 admits an $2$1-distinguishing formula. For the Markov chain instance this recovers Desharnais et al.'s characteristic logic, restricted to finitely branching systems; the other instances (metric transition systems, fuzzy transition systems, generative probabilistic transition systems) appear to be new.
Algorithmically, distinguishing formulae are extracted from memoryless Spoiler winning strategies by dynamic programming over game stages. The extracted formulae have quadratic modal rank and quartic dag size, and are computed in polynomial time when $2$2 is polynomial-time solvable. The dag measure matters because tree size of distinguishing formulae is worst-case exponential even for ordinary Kripke modal logic (2602.12084). In particular, this yields polynomial-time extraction of two-valued distinguishing formulae for Lévy–Prokhorov distance on labelled Markov chains — a result not obtainable from the original proof of Desharnais et al., which relies on a continuity argument enumerating all formulae and yields no size bound.
The second logic converts each $2$3-to-$2$4 lifting $2$5 into a $2$6-to-$2$7 Sugeno modality $2$8 via Sugeno integration:
$2$9
where V0. Combined with the non-expansive propositional base (min, max, truncated constant shifts), these generate a non-expansive coalgebraic modal logic whose Sugeno logical distance — the supremum of truth-value deviations across formulae — coincides with V1 on finitely branching coalgebras. Two facts make this construction effective: over finite sets the defining supremum is attained (a maximum), and the Sugeno construction preserves duals, enabling negation encoding when V2 is dual-closed. Several Sugeno modalities coincide with known operators: for subdistributions with the probability lifting, V3 is exactly the `generally' modality from probabilistic knowledge representation; for fuzzy powersets one obtains the standard fuzzy diamond; for metric transition systems the usual metric diamond.
Extraction of quantitative distinguishing formulae proceeds analogously from Spoiler strategies, again yielding quadratic modal rank, quartic dag size, and polynomial runtime under polynomial solvability. The most notable instantiation is polynomial-time extraction of characteristic formulae in the logic of generally witnessing lower bounds on Lévy–Prokhorov distance of Markov chains. The authors note that their complexity guarantee is incomparable to the recent algorithm of Rady and van Breugel for Kantorovich distances: theirs certifies exact witnesses under fixpoint iterates, whereas the present algorithm certifies distance strictly above a given threshold.
Kantorovich characterization
The final main result closes the loop: the Kantorovich lax extension V4 induced by the Sugeno modalities equals the threshold-based extension V5. This simultaneously establishes that V6 is a genuine quantitative lax extension (previously deferred) and transfers general Hennessy–Milner results for Kantorovich liftings to the threshold setting. Consequences include a Kantorovich characterization of Lévy–Prokhorov distance through generally, recovering a recent result of Wild et al. in the probabilistic case, plus new characterizations for labelled probabilistic, fuzzy, and metric transition systems.
Limitations and open questions
Several restrictions are acknowledged explicitly. All expressiveness and extraction guarantees require finite branching; extending the two-valued expressiveness theorem to countable branching, as covered by Desharnais et al., is left open. Kantorovich-type distances induced by expectation modalities fall outside the framework entirely. The polynomial bounds apply to dag size, not tree size, and the quasi-linear bounds achievable for two-valued equivalences via partition refinement presumably do not generalize to the quantitative setting. Finally, the authors leave open the development of generic reasoning algorithms (satisfiability, model checking) for the characteristic logics induced by V7-to-V8 liftings, pointing to non-expansive fuzzy V9 as a possible model, as well as extensions beyond distances to behavioural quasi-uniformities and general behavioural relations.
Conclusion
The paper unifies a family of threshold-based behavioural distances under a single coalgebraic parametrization by 2−⇒VFop0-to-2−⇒VFop1 predicate liftings, proves their coincidence with lax-extension-induced and Kantorovich/Sugeno-induced distances, and delivers generic polynomial-time algorithms for extracting distinguishing formulae in both two-valued and quantitative characteristic logics. Beyond recovering known results for Lévy–Prokhorov distance and metric transition systems, it yields new polynomial-time explainability results for probabilistic, fuzzy, and metric system classes, most prominently for 2−⇒VFop2-distance on labelled Markov chains.