An Abstract Coalgebraic Approach to Process Equivalence for Well-Behaved Operational Semantics

This thesis is part of the programme aimed at finding a mathematical theory of well-behaved structural operational semantics. General and basic results shown in 1997 in a seminal paper by Turi and Plotkin are extended in two directions, aiming at greater expressivity of the framework. The so-called bialgebraic framework of Turi and Plotkin is an abstract generalization of the well-known structural operational semantics format GSOS, and provides a theory of operational semantic rules for which bisimulation equivalence is a congruence. The first part of this thesis aims at extending that framework to cover other operational equivalences and preorders (e.g. trace equivalence), known collectively as the van Glabbeek spectrum. To do this, a novel coalgebraic approach to relations on processes is desirable, since the usual approach to coalgebraic bisimulations as spans of coalgebras does not extend easily to other known equivalences on processes. Such an approach, based on fibrations of test suites, is presented. Based on this, an abstract characterization of congruence formats is given, parametrized by the relation on processes that is expected to be compositional. This abstract characterization is then specialized to the case of trace equivalence, completed trace equivalence and failures equivalence. In the two latter cases, novel congruence formats are obtained, extending the current state of the art in this area of research. The second part of the thesis aims at extending the bialgebraic framework to cover a general class of recursive language constructs, defined by (possibly unguarded) recursive equations. Since unguarded equations may be a source of divergence, the entire framework is interpreted in a suitable domain category, instead of the category of sets and functions. It is shown that a class of recursive equations called regular equations can be merged seamlessly with GSOS operational rules, yielding well-behaved operational semantics for languages extended with recursive constructs.

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

[2]  Frits W. Vaandrager,et al.  On the relationship between process algebra and input/output automata , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[3]  Donald Sannella,et al.  Algebraic Preliminaries , 1999, Algebraic Foundations of Systems Specification.

[4]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[5]  Rasmus K. Ursem,et al.  Models for Evolutionary Algorithms and Their Applications in System Identification and Control Optimization , 2003 .

[6]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

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

[8]  Jan A. Bergstra,et al.  Process Algebra with Recursive Operations , 2001, Handbook of Process Algebra.

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

[10]  Daniele Turi,et al.  Axiomatic domain theory in categories of partial maps , 1998 .

[11]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[12]  D. Turi,et al.  Functional Operational Semantics and its Denotational Dual , 1996 .

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

[14]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[15]  Bart Jacobs,et al.  Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.

[16]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[17]  Michael Barr,et al.  Terminal coalgebras for endofunctors on sets , 2004 .

[18]  Serge Fehr,et al.  Secure Multi-Player Protocols: Fundamentals, Generality, and Efficiency , 2003 .

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

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

[21]  Steven J. Vickers,et al.  Quantales, observational logic and process semantics , 1993, Mathematical Structures in Computer Science.

[22]  G. M. Kelly,et al.  BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.

[23]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

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

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

[26]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

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

[28]  Luca Aceto,et al.  CPO Models for Compact GSOS Languages , 1996, Inf. Comput..

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

[30]  Glynn Winskel,et al.  A theory of recursive domains with applications to concurrency , 1997, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

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

[32]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[33]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[34]  Wan Fokkink,et al.  Precongruence formats for decorated trace semantics , 2002, TOCL.

[35]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

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

[37]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

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

[40]  Marcelo P. Fiore.  A Coinduction Principle for Recursive Data Types Based on Bisimulation , 1996, Inf. Comput..

[41]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[42]  M. Fiore.  A coinduction principle for recursive data types based on bisimulation , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[44]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[45]  Robin Milner,et al.  Definition of standard ML , 1990 .

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

[47]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[48]  Vincent Danos,et al.  Formal Molecular Biology done in CCS , 2003 .

[49]  Bartek Klin,et al.  Syntactic formats for free: An abstract approach to process equivalence , 2003 .

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

[51]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

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

[53]  Mads J. Jurik,et al.  Extensions to the Paillier Cryptosystem with Applications to Cryptological Protocols , 2003 .

[54]  Bart Jacobs.  Trace Semantics for Coalgebras , 2004, CMCS.

[55]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

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

[57]  Jesper Buus Nielsen,et al.  On Protocol Security in the Cryptographic Model , 2003 .

[58]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

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

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

[61]  Peter Aczel,et al.  A Coalgebraic View of Infinite Trees and Iteration , 2001, CMCS.

[62]  Marco Kick.  Rule Formats for Timed Processes , 2002, Electron. Notes Theor. Comput. Sci..

[63]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[64]  Aviv Regev,et al.  Representation and Simulation of Biochemical Processes Using the pi-Calculus Process Algebra , 2000, Pacific Symposium on Biocomputing.

[65]  John Power,et al.  Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads , 2000, CMCS.

[66]  Vaughan Pratt.  Chu Spaces , 1999 .

[67]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[68]  Paulo Oliva.  Proof Mining in Subsystems of Analysis , 2003 .

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

[70]  Gordon D. Plotkin,et al.  The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..

[71]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[72]  Mogens Nielsen,et al.  Open Maps (at) Work , 1995 .

[73]  Claus Brabrand,et al.  Domain Specific Languages for Interactive Web Services , 2003 .

[74]  Andrew M. Pitts,et al.  A co-Induction Principle for Recursively Defined Domains , 1994, Theor. Comput. Sci..

[75]  Jan J. M. M. Rutten,et al.  Initial Algebra and Final Coalgebra Semantics for Concurrency , 1993, REX School/Symposium.

[76]  Marcelo P. Fiore.  Axiomatic domain theory in categories of partial maps , 1994 .

[77]  Matthew Hennessy,et al.  Semantics of programming languages - an elementary introduction using structural operational semantics , 1990 .

[78]  Bart Jacobs,et al.  Structural Induction and Coinduction in a Fibrational Setting , 1998, Inf. Comput..

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

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

[81]  Dirk Pattinson,et al.  Semantical Principles in the Modal Logic of Coalgebras , 2001, STACS.

[82]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[83]  Slawomir Lasota.  Coalgebra morphisms subsume open maps , 1999, CMCS.

[84]  Wan Fokkink,et al.  Compositionality of Hennessy-Milner Logic through Structural Operational Semantics , 2003, FCT.

[85]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

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

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

[88]  H. Peter Gumm.  State based systems are coalgebras , 2003 .

[89]  Bartek Klin.  A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces , 2004, CMCS.

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

[91]  Fabio Gadducci,et al.  Denotational Testing Semantics in Coinductive Form , 2003, MFCS.

[92]  Jan J. M. M. Rutten.  A Strucutral Co-Induction Theorem , 1993, MFPS.

[93]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

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