Behavioral Metrics via Functor Lifting

We study behavioral metrics in an abstract coalgebraic setting. Given a coalgebra alpha: X -> FX in Set, where the functor F specifies the branching type, we define a framework for deriving pseudometrics on X which measure the behavioral distance of states. A first crucial step is the lifting of the functor F on Set to a functor in the category PMet of pseudometric spaces. We present two different approaches which can be viewed as generalizations of the Kantorovich and Wasserstein pseudometrics for probability measures. We show that the pseudometrics provided by the two approaches coincide on several natural examples, but in general they differ. Then a final coalgebra for F in Set can be endowed with a behavioral distance resulting as the smallest solution of a fixed-point equation, yielding the final coalgebra in PMet. The same technique, applied to an arbitrary coalgebra alpha: X -> FX in Set, provides the behavioral distance on X. Under some constraints we can prove that two states are at distance 0 if and only if they are behaviorally equivalent.

[1]  Radha Jagadeesan,et al.  Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..

[2]  Abbas Edalat,et al.  A logical characterization of bisimulation for labeled Markov processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[3]  Ana Sokolova,et al.  Probabilistic systems coalgebraically: A survey , 2011, Theor. Comput. Sci..

[4]  Luca de Alfaro,et al.  Linear and Branching System Metrics , 2009, IEEE Transactions on Software Engineering.

[5]  Catuscia Palamidessi,et al.  Generalized Bisimulation Metrics , 2014, CONCUR.

[6]  James Worrell,et al.  A behavioural pseudometric for probabilistic transition systems , 2005, Theor. Comput. Sci..

[7]  Theory of systems , 1978, Inf. Process. Manag..

[8]  Jurriaan Rot,et al.  Coinduction up-to in a fibrational setting , 2014, CSL-LICS.

[9]  Daniele Gorla,et al.  CONCUR 2014 – Concurrency Theory , 2014, Lecture Notes in Computer Science.

[10]  Kim G. Larsen,et al.  On-the-Fly Exact Computation of Bisimilarity Distances , 2013, TACAS.

[11]  Simone Tini,et al.  Compositionality of Approximate Bisimulation for Probabilistic Systems , 2013, EXPRESS/SOS.

[12]  Lutz Schröder Expressivity of Coalgebraic Modal Logic: The Limits and Beyond , 2005, FoSSaCS.

[13]  James Worrell,et al.  Approximating and computing behavioural distances in probabilistic transition systems , 2006, Theor. Comput. Sci..

[14]  Jiří Adámek,et al.  Free algebras and automata realizations in the language of categories , 1974 .

[15]  James Worrell,et al.  Recursively defined metric spaces without contraction , 2007, Theor. Comput. Sci..

[16]  James Worrell,et al.  Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems , 2007, Log. Methods Comput. Sci..

[17]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[18]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[19]  Radha Jagadeesan,et al.  The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[20]  Abbas Edalat,et al.  Bisimulation for labelled Markov processes , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[21]  Tom Chothia,et al.  Metrics for Action-labelled Quantitative Transition Systems , 2006, QAPL.

[22]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[23]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[24]  James Worrell,et al.  On the Complexity of Computing Probabilistic Bisimilarity , 2012, FoSSaCS.

[25]  Bart Jacobs,et al.  Coinductive Predicates and Final Sequences in a Fibration , 2013, MFPS.

[26]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[27]  Bartek Klin,et al.  Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..