Probabilistic systems coalgebraically: A survey

We survey the work on both discrete and continuous-space probabilistic systems as coalgebras, starting with how probabilistic systems are modeled as coalgebras and followed by a discussion of their bisimilarity and behavioral equivalence, mentioning results that follow from the coalgebraic treatment of probabilistic systems. It is interesting to note that, for different reasons, for both discrete and continuous probabilistic systems it may be more convenient to work with behavioral equivalence than with bisimilarity.

[1]  Kim Guldstrand Larsen,et al.  Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

[3]  Lawrence S. Moss,et al.  Final coalgebras for functors on measurable spaces , 2006, Inf. Comput..

[4]  H. Peter Gumm.  Copower functors , 2009, Theor. Comput. Sci..

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

[6]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[7]  Corina Cîrstea.  Modularity in Coalgebra , 2006, CMCS.

[8]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[9]  Ernst-Erich Doberkat,et al.  Semi-pullbacks and Bisimulations in Categories of Stochastic Relations , 2003, ICALP.

[10]  Ronald A. Howard,et al.  Dynamic Probabilistic Systems , 1971 .

[11]  Corina Cîrstea,et al.  Modular construction of complete coalgebraic logics , 2007, Theor. Comput. Sci..

[12]  Christel Baier,et al.  Validation of Stochastic Systems: A Guide to Current Research (Lecture Notes in Computer Science) , 2004 .

[13]  Ignacio Darío Viglizzo,et al.  Coalgebras on Measurable Spaces , 2010 .

[14]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[15]  Prakash Panangaden,et al.  Labelled Markov Processes , 2009 .

[16]  Alexandra Silva,et al.  Quantitative Kleene coalgebras , 2011, Inf. Comput..

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

[18]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

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

[20]  Erik P. de Vink,et al.  Probabilistic Automata: System Types, Parallel Composition and Comparison , 2004, Validation of Stochastic Systems.

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

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

[23]  Ernst-Erich Doberkat.  Stochastic Coalgebraic Logic , 2009, Monographs in Theoretical Computer Science. An EATCS Series.

[24]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[25]  A. Sokolova,et al.  Coalgebraic Weak Bisimulation for Action-Type Systems , 1985, Sci. Ann. Comput. Sci..

[26]  Ichiro Hasuo,et al.  Tracing Anonymity with Coalgebras , 2008 .

[27]  Bartek Klin,et al.  Structural Operational Semantics for Weighted Transition Systems , 2009, Semantics and Algebraic Specification.

[28]  Corina Cîrstea,et al.  A modular approach to defining and characterising notions of simulation , 2006, Inf. Comput..

[29]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[30]  Jan Rutten,et al.  On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces , 1998, Mathematical Structures in Computer Science.

[31]  Claire Jones,et al.  Probabilistic non-determinism , 1990 .

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

[33]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[34]  B. Banaschewski,et al.  Categorical Aspects of Topology and Analysis , 1982 .

[35]  Dirk Pattinson,et al.  Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra , 2011, Mathematical Structures in Computer Science.

[36]  Vladimiro Sassone,et al.  Structural Operational Semantics for Stochastic Process Calculi , 2008, FoSSaCS.

[37]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[38]  Ichiro Hasuo,et al.  Generic Forward and Backward Simulations II: Probabilistic Simulation , 2010, CONCUR.

[39]  R. Bellman.  A Markovian Decision Process , 1957 .

[40]  Ignacio Darío Viglizzo,et al.  Final Sequences and Final Coalgebras for Measurable Spaces , 2005, CALCO.

[41]  Joël Ouaknine,et al.  An Intrinsic Characterization of Approximate Probabilistic Bisimilarity , 2003, FoSSaCS.

[42]  Ana Sokolova,et al.  Exemplaric Expressivity of Modal Logics , 2010, J. Log. Comput..

[43]  Erik P. de Vink,et al.  Coalgebraic Weak Bisimulation for Action-Type Systems , 2009, Sci. Ann. Comput. Sci..

[44]  Joost-Pieter Katoen,et al.  On Generative Parallel Composition , 1998, PROBMIV.

[45]  B. Nordstrom.  FINITE MARKOV CHAINS , 2005 .

[46]  Roland Carl Backhouse,et al.  Algebraic and Coalgebraic Methods in the Mathematics of Program Construction , 2000, Lecture Notes in Computer Science.

[47]  F. Bartels.  On generalised coinduction and probabilistic specification formats : Distributive laws in coalgebraic modelling , 2004 .

[48]  Bart Jacobs,et al.  Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems , 2008, CMCS.

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

[50]  Uwe Wolter,et al.  On Corelations, Cokernels, and Coequations , 2000, CMCS.

[51]  Jan J. M. M. Rutten,et al.  On the Foundations of Final Coalgebra Semantics , 1998, Mathematical Structures in Computer Science.

[52]  James Worrell,et al.  An Accessible Approach to Behavioural Pseudometrics , 2005, ICALP.

[53]  James Worrell,et al.  Towards Quantitative Verification of Probabilistic Transition Systems , 2001, ICALP.

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

[55]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[56]  James Worrell,et al.  An Algorithm for Quantitative Verification of Probabilistic Transition Systems , 2001, CONCUR.

[57]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

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

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

[60]  Ichiro Hasuo,et al.  Probabilistic anonymity via coalgebraic simulations , 2007, Theor. Comput. Sci..

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

[62]  Radha Jagadeesan,et al.  Approximating labelled Markov processes , 2003, Inf. Comput..

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

[64]  Till Mossakowski,et al.  Iterative Circular Coinduction for CoCasl in Isabelle/HOL , 2005, FASE.

[65]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[66]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[67]  Corina Cîrstea,et al.  Modal Logics are Coalgebraic , 2008, Comput. J..

[68]  Bart Jacobs,et al.  Probabilities, distribution monads, and convex categories , 2011, Theor. Comput. Sci..

[69]  Joël Ouaknine,et al.  Domain theory, testing and simulation for labelled Markov processes , 2005, Theor. Comput. Sci..

[70]  H. Peter Gumm,et al.  Monoid-labeled transition systems , 2001, CMCS.

[71]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[72]  Bart Jacobs,et al.  Exercises in Coalgebraic Specification , 2000, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction.

[73]  Jens Palsberg,et al.  Semantics and Algebraic Specification, Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday , 2009, Semantics and Algebraic Specification.

[74]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

[75]  Glynn Winskel,et al.  Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.

[76]  Azaria Paz,et al.  Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[77]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

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

[79]  Alexandra Silva,et al.  Deriving Syntax and Axioms for Quantitative Regular Behaviours , 2009, CONCUR.

[80]  Ichiro Hasuo,et al.  Generic Forward and Backward Simulations , 2006, CONCUR.

[81]  Daniele Varacca,et al.  Probability, Nondeterminism and Concurrency: Two Denotational Models for Probabilistic Computation , 2003 .

[82]  Falk Bartels,et al.  GSOS for Probabilistic Transition Systems , 2002, CMCS.

[83]  Dirk Pattinson,et al.  Coalgebraic semantics of modal logics: An overview , 2011, Theor. Comput. Sci..

[84]  Amir Pnueli,et al.  Probabilistic Verification , 1993, Information and Computation.

[85]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.