Abstract

The reversible released form (RRF) of Petri nets is introduced as an extension of the released form. This new form introduces undo transitions in order to reverse the effect of some of the transitions of the original Petri net. It is shown that the RRF preserves the soundness property of workflow (WF) nets: a WF net is sound if and only if its RRF is sound too. Then, various properties of the RRF of circuit-based Petri nets are investigated, and complexity results of the soundness property of circuit-based WF nets are derived.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call