Universal Sleptsov net

References

• B. Berthomieu, O.-P. Ribet, and F. Vernadat, The tool TINA – construction of abstract state spaces for Petri nets and time Petri nets, Int. J. Prod. Res. 42 (4) (2004), pp. 2741–2756. doi: 10.1080/00207540412331312688
   Google Scholar
• H.-D. Burhard, On priorities of parallelism: Petri nets under the maximum firing strategy, Springer-Verlag, Berlin, in Lecture Notes in Computer Science: Logic of Programs and Their Applications, Vol. 148, 1983, pp. 86–97.
   Google Scholar
• M. Cook, Universality in elementary cellular automata, Complex Syst. 15 (1) (2004), pp. 1–40.
   Google Scholar
• V. Dimitrov, L. Imbert, and A. Zakaluzny, Multiplication by a constant is sublinear, 18th IEEE Symposium on Computer Arithmetic, Montepellier, June 25–27, 2007, pp. 261–268.
   Google Scholar
• J. Hartmanis and R.E. Stearns, On the computational complexity of algorithms, Trans. AMS 117 (1965), pp. 285–306. doi: 10.1090/S0002-9947-1965-0170805-7
   Web of Science ®Google Scholar
• J.E. Hopcroft, R. Motwani, and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, 2nd ed., Addison-Wesley, New York, 2001.
   Google Scholar
• S. Ivanov, E. Pelz, and S. Verlan, Small Universal Petri Nets with Inhibitor Arcs, Computability in Europe, Budapest, Hungary, June 23–27, 2014.
   Google Scholar
• Z.W. Li and M.C. Zhou, Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach, Springer-Verlag, London, 2010.
   Google Scholar
• T. Murata, Petri nets: Properties, analysis and applications, Proc. IEEE 77 (4) (1989), pp. 541–580. doi: 10.1109/5.24143
   Web of Science ®Google Scholar
• T. Neary, On the computational complexity of spiking neural P systems, Nat. Comput. 9 (4) (2010), pp. 831–851. doi: 10.1007/s11047-010-9213-1
   Google Scholar
• T. Neary and D. Woods, P-completeness of cellular automaton rule 110, 33rd International Colloquium on Automata, Languages and Programming (ICALP2006), Lecture Notes in Computer Science, Vol. 4051, part 1, 2006, pp. 132–143.
   Google Scholar
• T. Neary and D. Woods, Small weakly universal Turing machines, 17th International Symposium on Fundamentals of Computation Theory (FCT 2009), Vol. 5699 of Lecture Notes in Computer Science, Wroclaw, Poland, September 2009, pp. 262–273. doi: 10.1007/978-3-642-03409-1_24
   Google Scholar
• C.A. Petri, Kommunikation mit automaten, Ph.D. diss., Institiute of Instrumemental Mathematics, University of Bonn, Bonn, Germany, 1962.
   Google Scholar
• F.L. Tiplea and A.D. Diaconu, Petri net computers and workflow nets, IEEE Trans. Syst. Man Cybern. Syst. 45 (3) (2015), pp. 496–507. doi: 10.1109/TSMC.2014.2347933
   Web of Science ®Google Scholar
• A. Turing, On computable numbers, with an application to the entscheidungs problem, Proc. Lond. Math. Soc. 41 (1) (1936), pp. 230–265.
   Google Scholar
• H. Wang, A variant to Turing’s theory of computing machines, J. ACM 4 (1957), pp. 63–92. doi: 10.1145/320856.320867
   Web of Science ®Google Scholar
• D.A. Zaitsev, Universal petri net, Cybern. Syst. Anal. 48 (4) (2012), pp. 498–511. doi: 10.1007/s10559-012-9429-4
   Google Scholar
• D.A. Zaitsev, Small polynomial time universal Petri nets, arXiv:1309.7288, 2013. Available at http://arxiv.org/abs/1309.7288.
   Google Scholar
• D.A. Zaitsev, Toward the minimal universal petri net, IEEE Trans. Syst. Man Cybern. Syst. 44 (1) (2014), pp. 47–58. doi: 10.1109/TSMC.2012.2237549
   Web of Science ®Google Scholar
• D.A. Zaitsev, Sleptsov nets run fast, IEEE Trans. Syst. Man Cybern. Syst. (2015), pp. 1–12. 10.1109/TSMC.2015.2444414
   Web of Science ®Google Scholar
• D.A. Zaitsev and A.I. Sleptsov, State equations and equivalent transformations for timed Petri nets, Cybern. Syst. Anal. 33 (5) (1997), pp. 659–672. doi: 10.1007/BF02667189
   Google Scholar
• D.A. Zaitsev, I.D. Zaitsev, and T.R. Shmeleva, Infinite Petri nets as models of grids. Chapter 19, in Encyclopedia of Information Science and Technology, 3rd ed., 10 Vol., M. Khosrow-Pour, ed., IGI-Global, Hershey, 2014, pp. 187–204.
   Google Scholar