11 citations · 31 across the 6 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2023★ 7 cited
Sleptsov Nets are Turing-complete
Bernard Berthomieu, Dmitry A. Zaitsev
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. R…
cs.CC2022★ 11 cited
Strong Sleptsov Net is Turing-Complete
Dmitry A. Zaitsev
It is known that a Sleptsov net, with multiple firing a transition at a step, runs exponentially faster than a Petri net opening prospects for its application as a graphical langua…
cs.CC2013★ 3 cited
Small Polynomial Time Universal Petri Nets
Dmitry A. Zaitsev
The time complexity of the presented in 2013 by the author small universal Petri nets with the pairs of places/transitions numbers (14,42) and (14,29) was estimated as exponential.…