Reversing P/T Nets - Coordination Models and Languages Access content directly
Conference Papers Year : 2019

Reversing P/T Nets


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) based on two observations. Firstly, a net that explicitly expresses causality and conflict among events, e.g., an occurrence net, can be straightforwardly reversed by adding reversal for each of its transitions. Secondly, the standard unfolding construction associates a P/T net with an occurrence net that preserves all of its computation. Consequently, the reversible semantics of a P/T net can be obtained as the reversible semantics of its unfolding. We show that such reversible behaviour can be expressed as a finite net whose tokens are coloured by causal histories. Colours in our encoding resemble the causal memories that are typical in reversible process calculi.
Fichier principal
Vignette du fichier
478673_1_En_2_Chapter.pdf (388.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02365503 , version 1 (15-11-2019)





Hernán Melgratti, Claudio Antares Mezzina, Irek Ulidowski. Reversing P/T Nets. 21th International Conference on Coordination Languages and Models (COORDINATION), Jun 2019, Kongens Lyngby, Denmark. pp.19-36, ⟨10.1007/978-3-030-22397-7_2⟩. ⟨hal-02365503⟩
40 View
14 Download



Gmail Facebook X LinkedIn More