A Small Universal Petri Net

09/05/2013
by   Dmitry A. Zaitsev, et al.
0

A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is exponential in the running time of their weak machine. To simulate the blank words of the weakly universal Turing machine, a couple of dedicated transitions insert their codes when reaching edges of the working zone. To complete a chain of a given Petri net encoding to be executed by the universal Petri net, a translation of a bi-tag system into a Turing machine was constructed. The constructed Petri net is universal in the standard sense; a weaker form of universality for Petri nets was not introduced in this work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2021

What can we learn from universal Turing machines?

In the present paper, we construct what we call a pedagogical universal ...
research
06/17/2023

Sleptsov Nets are Turing-complete

The present paper proves that a Sleptsov net (SN) is Turing-complete, th...
research
01/22/2022

Strong Sleptsov Net is Turing-Complete

It is known that a Sleptsov net, with multiple firing a transition at a ...
research
08/13/2015

Logical N-AND Gate on a Molecular Turing Machine

In Boolean algebra, it is known that the logical function that correspon...
research
04/23/2019

A general architecture of oritatami systems for simulating arbitrary finite automata

In this paper, we propose an architecture of oritatami systems with whic...
research
08/30/2021

An outer totalistic weakly universal cellular automaton in the dodecagrid with four states

In this paper, we prove that there is an outer totalistic weakly univers...
research
10/12/2018

A Model for Auto-Programming for General Purposes

The Universal Turing Machine (TM) is a model for VonNeumann computers --...

Please sign up or login with your details

Forgot password? Click here to reset