Abstract Congruence Criteria for Weak Bisimilarity

We introduce three general compositionality criteria over operational semantics that guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's mathematical operational semantics and the coalgebraic approach to weak bisimulation by Brengos. We demonstrate each criterion with various examples of success and failure and give a formal proof of correctness for our main result.

[1]  Sam Staton,et al.  Relating Coalgebraic Notions of Bisimulation , 2009, CALCO.

[2]  Tomasz Brengos,et al.  Weak bisimulation for coalgebras over order enriched monads , 2013, Log. Methods Comput. Sci..

[3]  Davide Sangiorgi,et al.  Enhancements of the bisimulation proof method , 2012, Advanced Topics in Bisimulation and Coinduction.

[4]  Luca Aceto,et al.  Advanced Topics in Bisimulation and Coinduction , 2012, Cambridge tracts in theoretical computer science.

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

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

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

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

[9]  Glynn Winskel,et al.  Models for Concurrency , 1992 .

[10]  Jurriaan Rot,et al.  A general account of coinduction up-to , 2016, Acta Informatica.

[11]  Jurriaan Rot,et al.  Lax Bialgebras and Up-To Techniques for Weak Bisimulations , 2015, CONCUR.

[12]  Rob van Glabbeek.  Full Abstraction in Structural Operational Semantics , 1993 .

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

[14]  Dominique Devriese,et al.  A categorical approach to secure compilation , 2020, CMCS.

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

[16]  Andrew M. Pitts.  Reasoning about local variables with operationally-based logical relations , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[17]  Bart Jacobs,et al.  Introduction to Coalgebra: Towards Mathematics of States and Observation , 2016, Cambridge Tracts in Theoretical Computer Science.

[18]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

[19]  Andrew D. Gordon.  Bisimilarity as a theory of functional programming , 1995, MFPS.

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

[21]  Douglas J. Howe.  Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[22]  John Power,et al.  Category theory for operational semantics , 2004, Theor. Comput. Sci..

[23]  C.-H.L. Ong,et al.  Correspondence between operational and denotational semantics: the full abstraction problem for PCF , 1995, LICS 1995.

[24]  A. Pitts.  Parametric polymorphism and operational equivalence , 2000, Mathematical Structures in Computer Science.

[25]  Rob J. van Glabbeek,et al.  On cool congruence formats for weak bisimulations , 2005, Theor. Comput. Sci..

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

[27]  James H. Morris,et al.  Lambda-calculus models of programming languages. , 1969 .

[28]  Gordon D. Plotkin,et al.  Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[29]  Douglas J. Howe.  Equality in lazy computation systems , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[30]  John Power,et al.  A Coalgebraic Foundation for Linear Time Semantics , 1999, CTCS.

[31]  Mitchell Wand.  Fixed-Point Constructions in Order-Enriched Categories , 1979, Theor. Comput. Sci..

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

[33]  Dirk Pattinson,et al.  Coalgebraic Weak Bisimulation from Recursive Equations over Monads , 2014, ICALP.

[34]  Jirí Adámek,et al.  On Final Coalgebras of Power-Set Functors and Saturated Trees , 2015, Appl. Categorical Struct..

[35]  Marino Miculan,et al.  Behavioural equivalences for coalgebras with unobservable moves , 2014, J. Log. Algebraic Methods Program..

[36]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[37]  Hiroshi Watanabe,et al.  Well-behaved Translations between Structural Operational Semantics , 2002, CMCS.

[38]  Christoph Lüth,et al.  Algebras, Coalgebras, Monads and Comonads , 2001, CMCS.

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

[40]  Lars Birkedal,et al.  Logical Step-Indexed Logical Relations , 2009, LICS.

[41]  Theophilos Giannakopoulos,et al.  Contextual equivalence for a probabilistic language with continuous random variables and recursion , 2018, Proc. ACM Program. Lang..

[42]  Bard Bloom,et al.  Structural Operational Semantics for Weak Bisimulations , 1995, Theor. Comput. Sci..

[43]  Daniele Turi,et al.  Categorical Modelling of Structural Operational Rules: Case Studies , 1997, Category Theory and Computer Science.

[44]  Bart Jacobs,et al.  Parameters and Parametrization in Specification, Using Distributive Categories , 1995, Fundam. Informaticae.

[45]  Rob J. van Glabbeek.  Full Abstraction in Structural Operational Semantics (Extended Abstract) , 1993, AMAST.

[46]  Andrew M. Pitts,et al.  A Note on Logical Relations Between Semantics and Syntax , 1997, Log. J. IGPL.

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