Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time Additivity

Bernardo, Marco; Mezzina, Claudio A.

doi:10.1007/978-3-031-42626-1_2

Cited by 1 publication

(3 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, TCCS obeys to time additivity (two actions taking times t 1 and t 2 can be turned into a single action taking time t 1 + t 2 ), while TPL does not. As shown in [BM23], time additivity poses a problem with our approach: in presence of time additivity, the proof schema proposed in [LPU20] does not hold anymore. In particular, because of time additivity BTI does not hold anymore and Loop Lemma has to be formalised in a weaker form.…”

Section: Conclusion Related and Future Workmentioning

confidence: 99%

“…To simplify the discussion, we build on the categorisation in [BM23] and focus our comparison on the following time-related design choices: Separated vs integrated semantics: In the first case, actions are instantaneous and time only passes in between actions; hence, functional behaviour and time are orthogonal.…”

Section: Conclusion Related and Future Workmentioning

confidence: 99%

“…Building from the conference version of this article [BLMY22], the work in [BM23] has shown that our approach would apply also to a semantics with only eager actions and to a semantics with only lazy actions. However, the applicability of our approach to a scenario where each action can be statically set to be either lazy or eager (the 'either' option in the 'action' column of Table 1) needs to be further investigated.…”

Section: Conclusion Related and Future Workmentioning

confidence: 99%

See 2 more Smart Citations

revTPL: The Reversible Temporal Process Language

Bocchi,

Lanese,

Mezzina

et al. 2024

Logical Methods in Computer Science

View full text Add to dashboard Cite

Reversible debuggers help programmers to find the causes of misbehaviours in concurrent programs more quickly, by executing a program backwards from the point where a misbehaviour was observed, and looking for the bug(s) that caused it. Reversible debuggers can be founded on the well-studied theory of causal-consistent reversibility, which only allows one to undo an action provided that its consequences, if any, are undone beforehand. Causal-consistent reversibility yields more efficient debugging by reducing the number of states to be explored when looking backwards. Till now, causal-consistent reversibility has never considered time, which is 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.

show abstract

Section: Conclusion Related and Future Workmentioning

confidence: 99%

Section: Conclusion Related and Future Workmentioning

confidence: 99%