Sleptsov Nets are Turing-complete - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Sleptsov Nets are Turing-complete

Résumé

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.
Fichier principal
Vignette du fichier
2306.12440.pdf (448.49 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04139308 , version 1 (23-06-2023)

Identifiants

Citer

Bernard Berthomieu, Dmitry A Zaitsev. Sleptsov Nets are Turing-complete. 2023. ⟨hal-04139308⟩
71 Consultations
28 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More