A Small Universal Petri Net
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.
Code (0)
등록된 구현이 없습니다.
Tasks
TAGTranslationSimilar Papers 제목 키워드 기반
Encoding Petri Nets in Answer Set Programming for Simulation Based Reasoning
One of our long term research goals is to develop systems to answer realistic questions (e.g., some mentioned in textbooks) about biological pathways that a biologist may ask. To answer such questions we need formalisms …
Encoding Higher Level Extensions of Petri Nets in Answer Set Programming
Answering realistic questions about biological systems and pathways similar to the ones used by text books to test understanding of students about biological systems is one of our long term research goals. Often these qu…
Synthetic Petri Dish: A Novel Surrogate Model for Rapid Architecture Search
Neural Architecture Search (NAS) explores a large space of architectural motifs -- a compute-intensive process that often involves ground-truth evaluation of each motif by instantiating it within a large network, and tra…
Neural Architecture SearchTowards a Scientific Method for Dynamical Systems
The premise of this paper is the following value proposition: Models are good when they describe a system of phenomena, and they are better when they can predict the effect of interventions upon the system. We introduce …
Distributed Antenna Selection for Massive MIMO using Reversing Petri Nets
Distributed antenna selection for Distributed Massive MIMO (Multiple Input Multiple Output) communication systems reduces computational complexity compared to centralised approaches, and provides high fault tolerance whi…
Diversity