License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WPTE.2014.51
URN: urn:nbn:de:0030-drops-45827
Go to the corresponding OASIcs Volume Portal

Sabel, David

Structural Rewriting in the pi-Calculus

p051-06-sabel.pdf (0.5 MB)


We consider reduction in the synchronous pi-calculus with replication, without sums. Usual definitions of reduction in the pi-calculus use a closure w.r.t. structural congruence
of processes. In this paper we operationalize structural congruence by providing a reduction relation for pi-processes which also performs necessary structural conversions explicitly by
rewrite rules. As we show, a subset of structural congruence axioms is sufficient. We show that our rewrite strategy is equivalent to the usual strategy including structural congruence w.r.t.the observation of barbs and thus w.r.t. may- and should-testing equivalence in the pi-calculus.

BibTeX - Entry

  author =	{David Sabel},
  title =	{{Structural Rewriting in the pi-Calculus}},
  booktitle =	{First International Workshop on Rewriting Techniques for Program Transformations and Evaluation},
  pages =	{51--62},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-70-5},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{40},
  editor =	{Manfred Schmidt-Schau{\ss} and Masahiko Sakai and David Sabel and Yuki  Chiba},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-45827},
  doi =		{10.4230/OASIcs.WPTE.2014.51},
  annote =	{Keywords: Process calculi, Rewriting, Semantics}

Keywords: Process calculi, Rewriting, Semantics
Collection: First International Workshop on Rewriting Techniques for Program Transformations and Evaluation
Issue Date: 2014
Date of publication: 13.07.2014

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI