Coalgebraic Weak Bisimulation for Action-Type Systems

We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bifunctors in the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The particular transformation consists of two steps: First, the behavior on actions is lifted to behavior on finite words. Second, the behavior on finite words is taken modulo the hiding of internal or invisible actions, yielding behavior on equivalence classes of words closed under silent steps. The coalgebraic definition is validated by two correspondence results: one for the classical notion of weak bisimulation of Milner, another for the notion of weak bisimulation for generative probabilistic transition systems as advocated by Baier and Hermanns.

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

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

[3]  H. Gumm.  Elements Of The General Theory Of Coalgebras , 1999 .

[4]  Insup Lee,et al.  Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.

[5]  Jan J. M. M. Rutten,et al.  A note on coinduction and weak bisimilarity for while programs , 1998, RAIRO Theor. Informatics Appl..

[6]  Dragan Masulovic,et al.  Towards Weak Bisimulation For Coalgebras , 2002, Electron. Notes Theor. Comput. Sci..

[7]  Suzana Andova,et al.  Branching bisimulation for probabilistic systems: Characteristics and decidability , 2005, Theor. Comput. Sci..

[8]  Glynn Winskel,et al.  Weak bisimulation and open maps , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

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

[11]  H. Gumm.  Functors for Coalgebras , 2001 .

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

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

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

[15]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[16]  Manuel Núñez,et al.  Weak Stochastic Bisimulation for Non-markovian Processes , 2005, ICTAC.

[17]  Jasen Markovski,et al.  Lumping Markov Chains with Silent Steps , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[18]  Andrei Popescu.  Weak Bisimilarity Coalgebraically , 2009, CALCO.

[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]  Jos C. M. Baeten,et al.  A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification , 2006, CONCUR.

[21]  BaierChristel,et al.  Comparative branching-time semantics for Markov chains , 2005 .

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

[23]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

[24]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[25]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Radha Jagadeesan,et al.  Weak bisimulation is sound and complete for pCTL* , 2002, Inf. Comput..

[27]  Geoffrey Smith,et al.  Probabilistic noninterference through weak probabilistic bisimulation , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[28]  Alessandro Aldini,et al.  Probabilistic Information Flow in a Process Algebra , 2001, CONCUR.

[29]  Adriaan C. Zaanen,et al.  An introduction to the theory of integration , 1959 .

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

[31]  Suzana Andova,et al.  Equivalences for Silent Transitions in Probabilistic Systems: (Extended Abstract) , 2005, EXPRESS.

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

[33]  Andrea Maggiolo-Schettini,et al.  Weak bisimulation for probabilistic timed automata and applications to security , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..

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

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

[36]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[37]  A. Sokolova,et al.  A companion to coalgebraic weak bisimulation for action-type systems , 2007 .

[38]  Jan Rothe.  A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras , 2002, CMCS.

[39]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[40]  Mariëlle Stoelinga,et al.  Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .

[41]  Christel Baier,et al.  Comparative branching-time semantics for Markov chains , 2005, Inf. Comput..

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