The Reversible Temporal Process Language - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

The Reversible Temporal Process Language

Abstract

Reversible debuggers help programmers to quickly find the causes of misbehaviours in concurrent programs. These debuggers can be founded on the well-studied theory of causal-consistent reversibility, which allows one to undo any action provided that its consequences are undone beforehand. Till now, causal-consistent reversibility never considered time, a key aspect in real world applications. Here, we study the interplay between reversibility and time in concurrent systems via a process algebra. The Temporal Process Language (TPL) by Hennessy and Regan is a well-understood extension of CCS with discrete-time and a timeout operator. We define revTPL, a reversible extension of TPL, and we show that it satisfies the properties expected from a causal-consistent reversible calculus. We show that, alternatively, revTPL can be interpreted as an extension of reversible CCS with time.
Fichier principal
Vignette du fichier
timed.pdf (387.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : Copyright

Dates and versions

hal-03917240 , version 1 (01-01-2023)

Identifiers

Cite

Laura Bocchi, Ivan Lanese, Claudio Antares Mezzina, Shoji Yuen. The Reversible Temporal Process Language. FORTE 2022 - 42nd IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Jun 2022, Lucca, Italy. pp.31-49, ⟨10.1007/978-3-031-08679-3_3⟩. ⟨hal-03917240⟩
19 View
16 Download

Altmetric

Share

Gmail Facebook X LinkedIn More