Inhibitor Petri Net that Executes an Arbitrary Given Markov Normal Algorithm
Abstract
The inhibitor Petri net with a fixed structure that executes an arbitrary given Markov normal algorithm was constructed. The algorithm and its input string are encoded by nonnegative integer numbers and put into dedicated places of the Petri net which implements the application of algorithm productions over the string of symbols. The rules of the sequential, branching and cyclic processes encoding by Petri nets were used. At the completion of the net work, the output string is restored (decoded) from the integer form of representation. Within the paradigm of computations on Petri nets the net built provides the compatibility of systems.
References
1. Zaitsev D.A. Universal Inhibitor Petri Net // Proceedings of the 17th German Workshop on Algorithms and Tools for Petri Nets. Cottbus, Germany, October 07-08. 2010. P. 1-15. (<http://CEUR-WS.org/Vol-643/>).
2. Turing A.M. On Computable Numbers with an Application to the Entscheidungsproblem // Proceedings of the London Mathematical Society. 1936. 42. P. 230-265.
3. Марков А.А. Теория алгорифмов // Тр. МИАН. 1954. 42. 375 с.
4. Зайцев Д.А. Построение сети Петри исполняющей машину Тьюринга // Материалы IV международной научно-технической конференции «Компьютерная математика в науке, инженерии и образовании» (CMSEE-2010), г. Полтава, 1-31 октября 2010 г. Киев: Изд-во НАН Украины, 2010. С. 12-14.
5. Котов В.Е. Сети Петри. М.: Наука, 1984. 160 с.
6. Слепцов А.И., Юрасов А.А. Автоматизация проектирования управляющих систем гибких автоматизированных производств / Под ред. Б.Н. Малиновского. Киев: Техшка, 1986. 160 с.
Review
For citations:
Zaitsev D.A. Inhibitor Petri Net that Executes an Arbitrary Given Markov Normal Algorithm. Modeling and Analysis of Information Systems. 2011;18(4):80-93. (In Russ.)
Views:
551
Email this article 