Event structures for the reversible early internal π-calculus

Graversen, E., Phillips, I. and Yoshida, N. (2022) Event structures for the reversible early internal π-calculus. Journal of Logical and Algebraic Methods in Programming, 124, 100720. (doi: 10.1016/j.jlamp.2021.100720)

[img] Text
253600.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

698kB

Abstract

The π-calculus is a widely used process calculus, which models communications between processes and allows the passing of communication links. Various operational semantics of the π-calculus have been proposed, which can be classified according to whether transitions are unlabelled (so-called reductions) or labelled. With labelled transitions, we can distinguish early and late semantics. The early version allows a process to receive names it already knows from the environment, while the late semantics and reduction semantics do not. All existing reversible versions of the π-calculus use reduction or late semantics, despite the early semantics of the (forward-only) π-calculus being more widely used than the late. We introduce two reversible forms of the internal π-calculus; these are the first to use early semantics. The internal π-calculus is a subset of the π-calculus where every link sent by an output is private, yielding greater symmetry between inputs and outputs. One of the new reversible calculi uses static reversibility, where performing an action does not change the structure of the process, and the other uses dynamic reversibility, where performing an action moves it to a separate history. We show an operational correspondence between the two calculi. For the static calculus we define denotational event structure semantics, which generate an event structure inductively on the structure on the process. For the dynamic calculus we define operational event structure semantics, which generate an event structure based on a labelled asynchronous transition system. We describe a correspondence between the resulting event structures.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Yoshida, Professor Nobuko
Authors: Graversen, E., Phillips, I., and Yoshida, N.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Journal of Logical and Algebraic Methods in Programming
Publisher:Elsevier
ISSN:2352-2208
ISSN (Online):2352-2216
Published Online:21 September 2021
Copyright Holders:Copyright © 2021 Elsevier Inc.
First Published:First published in Journal of Logical and Algebraic Methods in Programming 124: 100720
Publisher Policy:Reproduced in accordance with the publisher copyright policy

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
309899AppControl/C2AB: Capability-based Control of Application BehaviourWim VanderbauwhedeEngineering and Physical Sciences Research Council (EPSRC)EP/V000462/1Computing Science
168293From Data Types to Session Types - A Basis for Concurrency and Distribution.Simon GayEngineering and Physical Sciences Research Council (EPSRC)EP/K034413/1Computing Science
168656Exploiting Parallelism through Type Transformations for Hybrid Manycore Systems.Wim VanderbauwhedeEngineering and Physical Sciences Research Council (EPSRC)EP/L00058X/1Computing Science
172893Border Patrol: Improving Hardware Security through Type-Aware Systems DesignWim VanderbauwhedeEngineering and Physical Sciences Research Council (EPSRC)EP/N028201/1Computing Science