Reversing Place Transition 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) base...
Main Authors: | Hernán Melgratti, Claudio Antares Mezzina, Irek Ulidowski |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2020-10-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/5831/pdf |
Similar Items
Similar Items
-
Connector algebras for C/E and P/T nets' interactions
by: Roberto Bruni, et al.
Published: (2013-09-01) -
Priced Timed Petri Nets
by: Richard M. Mayr, et al.
Published: (2013-11-01) -
Separators in Continuous Petri Nets
by: Michael Blondin, et al.
Published: (2024-02-01) -
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
by: J. Leroux, et al.
Published: (2019-12-01) -
revTPL: The Reversible Temporal Process Language
by: Laura Bocchi, et al.
Published: (2024-01-01)