论文信息 - Weak Bisimulations for Coalgebras over Ordered Functors

Weak Bisimulations for Coalgebras over Ordered Functors

The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction principle.

Tomasz Brengos

[1] Bengt Jonsson,et al. CONCUR ’94: Concurrency Theory , 1994, Lecture Notes in Computer Science.

[2] Bart Jacobs,et al. Simulations in Coalgebra , 2003, CMCS.

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

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

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

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

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

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

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

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

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

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

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