On Rule Formats for Zero and Unit Elements

This paper proposes a rule format for Structural Operational Semantics guaranteeing that certain constants act as left or right zero elements for a set of binary operators. Our design approach is also applied to reformulate an earlier rule format for unit elements developed by some of the authors. Examples of left and right zero, as well as unit, elements from the literature are shown to be checkable using the provided formats.

[1]  Jos C. M. Baeten,et al.  Process Algebra: Equational Theories of Communicating Processes , 2009 .

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

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

[4]  Arnar Birgisson,et al.  Rule formats for determinism and idempotence , 2009, Sci. Comput. Program..

[5]  Jan Friso Groote,et al.  A syntactic commutativity format for SOS , 2005, Inf. Process. Lett..

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

[7]  Luca Aceto,et al.  SOS rule formats for zero and unit elements , 2011, Theor. Comput. Sci..

[8]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[9]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

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

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

[12]  Luca Aceto,et al.  A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages , 2010, SOS.

[13]  Sjoerd Cranen,et al.  A Rule Format for Associativity , 2008, CONCUR.

[14]  Jan A. Bergstra,et al.  Preferential choice and coordination conditions , 2007, J. Log. Algebraic Methods Program..

[15]  Jan A. Bergstra,et al.  Discrete time process algebra , 1992, Formal Aspects of Computing.

[16]  Jan Friso Groote,et al.  SOS formats and meta-theory: 20 years after , 2007, Theor. Comput. Sci..

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

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

[19]  Jan A. Bergstra,et al.  Process Algebra with a Zero Object , 1990, CONCUR.

[20]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

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

[22]  J. Bergstra,et al.  Mode transfer in process algebra , 2000 .

[23]  Luca Aceto,et al.  A Rule Format for Unit Elements , 2009, SOFSEM.

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

[25]  Gordon D. Plotkin,et al.  A Powerdomain for Countable Non-Determinism (Extended Abstract) , 1982, ICALP.

[26]  Erik P. de Vink,et al.  Axiomatizing GSOS with termination , 2002, J. Log. Algebraic Methods Program..

[27]  Luca Aceto,et al.  Algebraic Properties for Free! , 2009, Bull. EATCS.

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