Combining Bialgebraic Semantics and Equations

It was observed by Turi and Plotkin that structural operational semantics can be studied at the level of universal coalgebra, providing specification formats for well-behaved operations on many different types of systems. We extend this framework with non-structural assignment rules which can express, for example, the syntactic format for structural congruences proposed by Mousavi and Reniers. Our main result is that the operational model of such an extended specification is well-behaved, in the sense that bisimilarity is a congruence and that bisimulation-up-to techniques are sound.

[1]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[2]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

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

[4]  D. Sangiorgi.  Introduction to Bisimulation and Coinduction , 2011 .

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

[6]  Jurriaan Rot,et al.  Coalgebraic Bisimulation-Up-To , 2013, SOFSEM.

[7]  Mohammad Reza Mousavi,et al.  Congruence for Structural Congruences , 2005, FoSSaCS.

[8]  Reiko Heckel,et al.  Compositional SOS and beyond: a coalgebraic view of open systems , 2002, Theor. Comput. Sci..

[9]  Harald Sack,et al.  SOFSEM 2013: Theory and Practice of Computer Science , 2013, Lecture Notes in Computer Science.

[10]  Marko C. J. D. van Eekelen,et al.  Modular Bialgebraic Semantics and Algebraic Laws , 2013, SBLP.

[11]  F. Bartels,et al.  On Generalised Coinduction and Probabilistic Specification Formats , 2004 .

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

[13]  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.

[14]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[15]  Clemens Kupke.  Stream Differential Equations: concrete formats for coinductive definitions , 2011 .

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

[17]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[18]  Jan J. M. M. Rutten,et al.  Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..

[19]  Robin Milner.  Functions as Processes , 1990, ICALP.

[20]  Jurriaan Rot,et al.  Presenting Distributive Laws , 2013, CALCO.

[21]  Ugo Montanari,et al.  A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence , 2002, CONCUR.

[22]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[23]  Bartek Klin.  Adding recursive constructs to bialgebraic semantics , 2004, J. Log. Algebraic Methods Program..

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

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

[26]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[27]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

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

[29]  Gordon Plotkin.  Bialgebraic Semantics and Recursion (Extended Abstract) , 2001, CMCS.