The present paper proves that a Sleptsov net (SN) is Turing-complete, th...
We define a method for taking advantage of net reductions in combination...
Although decidable, the marking reachability problem for Petri nets is
w...
Petri nets proved useful to describe various real-world systems, but man...
We propose a method to count the number of reachable markings of a Petri...