Coalgebraic logic for stochastic right coalgebras

We generalize stochastic Kripke models and Markov transition systems to stochastic right coalgebras. These are coalgebras for a functor F⋅S with F as an endofunctor on the category of analytic spaces, and S is the subprobability functor. The modal operators are generalized through predicate liftings which are set-valued natural transformations involving the functor. Two states are equivalent iff they cannot be separated by a formula. This equivalence relation is used to construct a cospan for logical equivalent coalgebras under a separation condition for the set of predicate liftings. Consequently, behavioral and logical equivalence are really the same. From the cospan we construct a span. The central argument is a selection argument giving us the dynamics of a mediating coalgebra from the domains of the cospan. This construction is used to establish that behavioral equivalent coalgebras are bisimilar, yielding the equivalence of all three characterizations of a coalgebra’s behavior as in the case of Kripke models or Markov transition systems.

[1]  Daniel H. Wagner Survey of Measurable Selection Theorems , 1977 .

[2]  E. Doberkat Stochastic Relations : Foundations for Markov Transition Systems , 2007 .

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

[4]  Ernst-Erich Doberkat Semi-pullbacks for stochastic relations over analytic spaces , 2005, Math. Struct. Comput. Sci..

[5]  Ana Sokolova,et al.  Coalgebraic analysis of probabilistic systems , 2005 .

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

[7]  Dirk Pattinson,et al.  Modular Algorithms for Heterogeneous Modal Logics , 2007, ICALP.

[8]  Ernst-Erich Doberkat Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem , 2005, SIAM J. Comput..

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

[10]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[11]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[12]  Ernst-Erich Doberkat Look: Simple Stochastic Relations Are Just, Well, Simple , 2005, CALCO.

[13]  Ernst-Erich Doberkat,et al.  Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence , 2008, Ann. Pure Appl. Log..

[14]  E. Doberkat Stochastic Relations , 2007 .

[15]  S. Lane Categories for the Working Mathematician , 1971 .

[16]  C. J. Himmelberg,et al.  On measurable relations , 1982 .

[17]  Vincent Danos,et al.  Bisimulation and cocongruence for probabilistic systems , 2006, Inf. Comput..

[18]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[19]  Dirk Pattinson Expressive Logics for Coalgebras via Terminal Sequence Induction , 2004, Notre Dame J. Formal Log..

[20]  A. Kechris Classical descriptive set theory , 1987 .

[21]  Shashi M. Srivastava,et al.  A Course on Borel Sets , 1998, Graduate texts in mathematics.

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

[23]  C. Castaing Sur les multi-applications mesurables , 1967 .

[24]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[25]  Roman Fric,et al.  A Categorical Approach to Probability Theory , 2010, Stud Logica.

[26]  W. Arveson An Invitation To C*-Algebras , 1976 .