Search

• < Previous
• 1
• Next >

---

Reversing Place Transition Nets

Hernán Melgratti ; Claudio Antares Mezzina ; Irek Ulidowski.

Petri nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a satisfactory causally reversible semantics. We develop such semantics for Place/Transitions Petri nets (P/T nets)&nbsp;[&hellip;]

---

Causal Consistency for Reversible Multiparty Protocols

Claudio Antares Mezzina ; Jorge A. Pérez.

In programming models with a reversible semantics, computational steps can be undone. This paper addresses the integration of reversible semantics into process languages for communication-centric systems equipped with behavioral types. In prior work, we introduced a monitors-as-memories approach to&nbsp;[&hellip;]

---

revTPL: The Reversible Temporal Process Language

Laura Bocchi ; Ivan Lanese ; Claudio Antares Mezzina ; Shoji Yuen.

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&nbsp;[&hellip;]

---