Reversing single sessions

DOI10.1007/978-3-319-40578-0_4MaRDI QIDQ3186584zbMATH OpenOpenAlexFDO

Authors Francesco Tiezzi, Nobuko Yoshida

Publication date 10 August 2016

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.07253

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: Session-based communication has gained a widespread acceptance in practice as a means for developing safe communicating systems via structured interactions. In this paper, we investigate how these structured interactions are affected by reversibility, which provides a computational model allowing executed interactions to be undone. In particular, we provide a systematic study of the integration of different notions of reversibility in both binary and multiparty single sessions. The considered forms of reversibility are: one for completely reversing a given session with one backward step, and another for also restoring any intermediate state of the session with either one backward step or multiple ones. We analyse the costs of reversing a session in all these different settings. Our results show that extending binary single sessions to multiparty ones does not affect the reversibility machinery and its costs.

Recommendations

• Reversible session-based pi-calculus
• Reversibility in session-based concurrency: a fresh look
• Reversible multiparty sessions with checkpoints
• Reversible sessions with flexible choices
• CONCUR 2004 - Concurrency Theory

Cites work

• A calculus of mobile processes. I
• A compositional semantics for the reversible -calculus
• Asynchronous Session Types and Progress for Object Oriented Languages
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Controlling Reversibility in Higher-Order Pi
• Globally governed session semantics
• Minimal and Optimal Computations of Recursive Programs
• Multiparty asynchronous session types
• Reversible session-based pi-calculus
• Reversing algebraic process calculi
• Reversing Higher-Order Pi
• Reversing single sessions
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Sub-behaviour relations for session-based client/server systems

Cited in

(10)

• Reversible sessions with flexible choices
• Reversibility in session-based concurrency: a fresh look
• Reversible client/server interactions
• Reversing single sessions
• Reversible session-based pi-calculus
• Reversible multiparty sessions with checkpoints
• scientific article; zbMATH DE number 7471661 (Why is no real title available?)
• Concurrent reversible sessions
• Global types and event structure semantics for asynchronous multiparty sessions
• Checkpoint-based rollback recovery in session programming

This page was built for publication: Reversing single sessions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186584)