Search

• < Previous
• 1
• Next >

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