Rule formats for distributivity

This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. Some conditions ensuring the invalidity of the left-distributivity law are also offered.

[1]  Ed Brinksma,et al.  A tutorial on LOTOS , 1985, PSTV.

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

[3]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

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

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

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

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

[8]  Luca Aceto,et al.  On Rule Formats for Zero and Unit Elements , 2010, MFPS.

[9]  Luca Aceto,et al.  Bisimilarity is not finitely based over BPA with interrupt , 2006, Theor. Comput. Sci..

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

[11]  Faron Moller.  The Importance of the Left Merge Operator in Process Algebras , 1990, ICALP.

[12]  Faron Moller,et al.  The nonexistence of finite axiomatisations for CCS congruences , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

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

[15]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

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

[17]  W. Fokkink,et al.  Finite equational bases in process algebra: results and open questions , 2005 .

[18]  Luca Aceto,et al.  Rule Formats for Distributivity , 2011, LATA.

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

[20]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

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

[22]  Bas Luttik,et al.  CCS with Hennessy's merge has no finite-equational axiomatization , 2005, Theor. Comput. Sci..

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

[24]  Arnar Birgisson,et al.  Rule formats for determinism and idempotence , 2009 .

[25]  Irek Ulidowski,et al.  Semantics and expressiveness of ordered SOS , 2009, Inf. Comput..

[26]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

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

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

[29]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

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

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

[32]  Bas Luttik,et al.  A finite equational base for CCS with left merge and communication merge , 2009, TOCL.