Sleptsov Nets are Turing-complete

06/17/2023
by   Bernard Berthomieu, et al.
0

The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled transitions at their maximal firing multiplicity, as a single step, leaving for a nondeterministic choice of which fireable transitions to fire. A strong SN restricts nondeterministic choice to firing only the transitions having the highest firing multiplicity.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset