Congruence from the operator’s point of view

A basic sanity property of a process semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by developing, for a specific process semantics, a syntactic format for operational semantics specifications. We suggest a novel, orthogonal approach, which focuses on a specific process operator and determines a class of congruence relations for this operator. To this end, we impose syntactic restrictions on Hennessy–Milner logic, so that a process semantics whose modal characterization satisfies those criteria is guaranteed to be a congruence with respect to the operator in question. We investigate alternative composition, action prefix, projection, encapsulation, renaming, and parallel composition with communication, in the context of both concrete and weak process semantics.

[1]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[2]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[3]  Wan Fokkink,et al.  Compositionality of Hennessy-Milner logic by structural operational semantics , 2006, Theor. Comput. Sci..

[4]  Bas Luttik,et al.  Divide and Congruence III: Stability & Divergence , 2017, CONCUR.

[5]  R. V. Glabbeek The Linear Time-Branching Time Spectrum I The Semantics of Concrete , Sequential ProcessesR , 2007 .

[6]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

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

[8]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[9]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

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

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

[12]  Wan Fokkink,et al.  Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity , 2012, Inf. Comput..

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

[14]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[15]  Luca Aceto,et al.  Characteristic formulae for fixed-point semantics: a general framework , 2009, Mathematical Structures in Computer Science.

[16]  R. V. Glabbeek The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[17]  Jan A. Bergstra,et al.  Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..

[18]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .