Strong Sleptsov nets are Turing complete - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Sciences Année : 2023

Strong Sleptsov nets are Turing complete

Résumé

It is known that a Sleptsov net, with multiple firing of a transition at a step, runs exponentially faster than a Petri net, opening prospects for its application as a graphical language of concurrent programming. We provide a classification of place-transition nets based on firability rules considering general definitions and their strong and weak variants. We introduce and study a strong Sleptsov net, where a transition with the maximal firing multiplicity fires at a step, and prove that it is Turing complete. We follow the proof pattern of Peterson which he applied to prove that an inhibitor Petri net is Turing complete by simulating a Shepherdson and Sturgis register machine. The central construct of our proof is a strong Sleptsov net that checks whether a register value (place marking) equals zero.
Fichier non déposé

Dates et versions

hal-04267968 , version 1 (02-11-2023)

Identifiants

Citer

Dmitry Zaitsev. Strong Sleptsov nets are Turing complete. Information Sciences, 2023, 621, pp.172-182. ⟨10.1016/j.ins.2022.11.098⟩. ⟨hal-04267968⟩
12 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More