A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics

We introduce a mathematical structural operational semantics that yields a congruence result for bisimilarity and is suitable for investigating rule formats for name-passing systems. Indeed, we instantiate this general abstract model theory in a framework of nominal sets and extract from it a GSOS-like rule format for name-passing process calculi for which the associated notion of behavioural equivalence - given by a form of open bisimilarity - is a congruence

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

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

[3]  AbadiMartín,et al.  Mobile values, new names, and secure communication , 2001 .

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

[5]  E. Moggi,et al.  A fully-abstract model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[6]  Davide Sangiorgi,et al.  Lazy functions and mobile processes , 2000, Proof, Language, and Interaction.

[7]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

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

[9]  Frits W. Vaandrager,et al.  SOS Rule Formats for Parameterized and State-Bearing Processes , 1995 .

[10]  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).

[11]  Rasmus Ejlers Møgelberg,et al.  Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science , 2007 .

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

[13]  S. Lack,et al.  The formal theory of monads II , 2002 .

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

[15]  Björn Victor,et al.  Relationally Staged Computations in Calculi of Mobile Processes , 2004, CMCS.

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

[17]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[18]  Bartek Klin,et al.  From Bialgebraic Semantics to Congruence Formats , 2005, SOS@CONCUR.

[19]  Peter Sewell,et al.  Models for name-passing processes: interleaving and causal , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

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

[21]  Sam Staton,et al.  Comparing Operational Models of Name-Passing Process Calculi , 2004, CMCS.

[22]  Davide Sangiorgi,et al.  A Fully Abstract Model for the [pi]-calculus , 1996, Inf. Comput..

[23]  Andrew M. Pitts,et al.  A new approach to abstract syntax involving binders , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[24]  I. Stark,et al.  A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[25]  Björn Victor,et al.  The Update Calculus (Extended Abstract) , 1997, AMAST.

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

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

[28]  Davide Sangiorgi,et al.  A Theory of Bisimulation for the pi-Calculus , 1993, CONCUR.

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

[30]  Samuel Staton.  Name-passing process calculi : operational models and structural operational semantics , 2007 .

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