Skip to main navigation Skip to search Skip to main content

Encoding choice and replication in roll-π

  • Adam David Barwell*
  • , Ping Hou*
  • , Martin Vassor*
  • , Nobuko Yoshida*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Reversible process calculi, such as roll-π, can accommodate fault-tolerant communication protocols. However, untyped process calculi cannot guarantee desirable behavioural properties such as deadlock- freedom. Concomitantly, Multiparty Session Types (MPST) can provide such guarantees by construction, but often do not consider failures. This suggests that, by leveraging both MPST and roll-π, we can facilitate the representation of failures without requiring a significant extension to the MPST theory. However, roll-π lacks choice and replication primitives, which are key features for an MPST-based type system. Nonetheless, its expressiveness allows these constructs to be encoded directly. In this pa- per, we introduce roll-π!⊕, a variant of roll-π that incorporates choice and replication, and outline its encoding in roll-π. This extension lays the foundation for integrating roll-π with MPST.
Original languageEnglish
Title of host publicationReversible computation
Subtitle of host publication17th international conference, RC 2025, Odense, Denmark, July 3–4, 2025, proceedings
EditorsRobert Glück, Robin Kaarsgaard
Place of PublicationCham
PublisherSpringer
Pages27-36
Number of pages10
ISBN (Electronic)9783031970634
ISBN (Print)9783031970627
DOIs
Publication statusPublished - 2025

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Cham
Volume15716
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Reversible process calculus
  • Causally consistent rollback
  • Multiparty session types
  • Fault-tolerance

Fingerprint

Dive into the research topics of 'Encoding choice and replication in roll-π'. Together they form a unique fingerprint.

Cite this