Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifications of NRTSs that ensure that the associated NRTS is an NTS and apply them to the operational specifications of the early and late pi-calculus. We also explore alternative specifications of the NTSs in which we allow residuals of abstraction sort, and introduce translations between the systems with and without residuals of abstraction sort. Our study stems from the Nominal SOS of Cimini et al. and from earlier works in nominal sets and nominal logic by Gabbay, Pitts and their collaborators.

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

[2]  J. Lambek.  A fixpoint theorem for complete categories , 1968 .

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

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

[5]  Wan Fokkink,et al.  A Conservative Look at Operational Semantics with Variable Binding , 1998, Inf. Comput..

[6]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[7]  Maribel Fernández,et al.  Nominal rewriting , 2007, Inf. Comput..

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

[9]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[10]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[11]  Joachim Parrow,et al.  Formalising the pi-Calculus Using Nominal Logic , 2007, FoSSaCS.

[12]  Murdoch James Gabbay,et al.  Nominal (Universal) Algebra: Equational Logic with Names and Binding , 2009, J. Log. Comput..

[13]  Murdoch James Gabbay,et al.  A Nominal Axiomatization of the Lambda Calculus , 2010, J. Log. Comput..

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

[15]  Lars-Henrik Eriksson,et al.  Modal Logics for Nominal Transition Systems , 2019, CONCUR.

[16]  Christian Urban,et al.  Nominal unification , 2004, Theor. Comput. Sci..

[17]  Mohammad Reza Mousavi,et al.  Nominal SOS , 2012, MFPS.

[18]  Andrew M. Pitts,et al.  FreshML: programming with binders made simple , 2003, ICFP '03.

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

[20]  Kees Middelburg,et al.  Variable binding operators in transition system specifications , 2000, J. Log. Algebraic Methods Program..

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

[22]  Andrew M. Pitts.  Nominal techniques , 2016, SIGL.

[23]  Dale Miller,et al.  A proof theory for generic judgments , 2005, TOCL.

[24]  Martin Hofmann,et al.  Nominal Renaming Sets , 2008, LPAR.

[25]  Luca Aceto,et al.  A unified rule format for bounded nondeterminism in SOS with terms as labels , 2017, J. Log. Algebraic Methods Program..

[26]  Sam Staton,et al.  A congruence rule format for name-passing process calculi , 2009, Inf. Comput..

[27]  Wan Fokkink,et al.  Structural operational semantics and bounded nondeterminism , 2003, Acta Informatica.

[28]  Dale Miller,et al.  A Congruence Format for Name-passing Calculi , 2006, SOS@ICALP.

[29]  Andrew M. Pitts,et al.  Nominal Equational Logic , 2007, Electron. Notes Theor. Comput. Sci..

[30]  Lars-Henrik Eriksson,et al.  Weak Nominal Modal Logic , 2017, FORTE.

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

[32]  Andrew M. Pitts,et al.  Nominal Sets: Names and Symmetry in Computer Science , 2013 .

[33]  Kees Middelburg.  An alternative formulation of operational conservativity with binding terms , 2003, J. Log. Algebraic Methods Program..

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

[35]  Davide Sangiorgi.  pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[36]  Karen L. Bernstein.  A congruence theorem for structured operational semantics of higher-order languages , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).