From strong to exact Petri net computers

References

• Lipton RJ. The reachability problem requires exponential space. Tech. Rep., 1976. [Online]. Available from: http://www.cs.yale.edu/publications/techreports/tr63.pdf.
   Google Scholar
• Ding Z, Pan M, Yang R, et al. Fully expanded tree for property analysis of one-place-unbounded Petri nets. IEEE Trans Syst Man Cyber Syst. 2017;47(9):2574–2585.
   Web of Science ®Google Scholar
• Yang R, Ding Z, Pan M, et al. Liveness analysis of ω-independent Petri nets based on new modified reachability trees. IEEE Trans Syst Man Cyber Syst. 2017;47(9):2601–2612.
   Web of Science ®Google Scholar
• Tiplea FL, Diaconu RA. Petri net computers and workflow nets. IEEE Trans Syst Man Cyber Syst. 2015;45(3):496–507.
   Web of Science ®Google Scholar
• Zaitsev DA. Toward the minimal universal Petri net. IEEE Trans Syst Man Cyber Syst. 2014;44(1):47–58.
   Web of Science ®Google Scholar
• Alhazov A, Ivanov S, Pelz E, et al. Small universal deterministic Petri nets with inhibitor arcs. J Autom Lang Comb. 2016;21(1):7–26.
   Google Scholar
• Liao W, Li W. Automatic concurrent program generation from Petri nets. In 12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science. 2013. p. 34–39.
   Google Scholar
• Liu D, Li ZW, Zhou MC. Hybrid liveness-enforcing policy for generalized petri net models of flexible manufacturing systems. IEEE Trans Syst Man Cyber Syst. 2013;43(1):85–97.
   Web of Science ®Google Scholar
• Yang FJ, Wu NQ, Qiao Y, et al. Polynomial approach to optimal one-wafer cyclic scheduling of treelike hybrid multi-cluster tools via Petri nets. IEEE/CAA J Autom Sinica. 2018 Jan;5(1):270–280.
   Google Scholar
• Luo J, Liu Z, Zhou MC, et al. Deadlock-free scheduling of flexible assembly systems based on petri nets and local search. IEEE Trans Systems Man Cybernetics Syst. 2018 Sept;50(10):3658–3669.
   Web of Science ®Google Scholar
• Zhu Q, Zhou M, Qiao Y, et al. Petri net modeling and scheduling of a close-down process for time-constrained single-arm cluster tools. IEEE Trans Syst Man Cyber Syst. 2018 Mar;48(3):389–400.
   Web of Science ®Google Scholar
• Esparza J. Decidability and complexity of Petri net problems -- an introduction. LNCS. 1996;1491:374–428. [Online]. Available: http://www7.in.tum.de/um/bibdb/esparza/course.pdf
   Google Scholar
• Murata T. Petri nets: properties, analysis and applications. Proc IEEE. 1989 Apr;77(4):541–580.
   Web of Science ®Google Scholar
• Karp RM, Miller RE. Parallel program schemata. J Comput Syst Sci. 1969;3(2):147–195.
   Google Scholar
• Barkaoui K, Minoux M. A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. LNCS. 1992;616:62–75.
   Google Scholar
• Zaitsev DA. Generator of Petri nets which count double exponent after R.J. Lipton and J. Esparza constructs. 16 June 2016. [Online]. Available from: https://github.com/dazeorgacm/depn.
   Google Scholar
• Zaitsev D. Some remarks on petri net computers: weak, exact, and strong. Petri Net Newsletter. 2016 Dec;85:3–7. Cover Picture Story
   Google Scholar
• Zaitsev DA. Sequential composition of linear system's clans. Inform Sci. 2016;363:292–307.
   Web of Science ®Google Scholar
• Berthomieu B, Ribet O-P, Vernadat F. The tool Tina -- construction of abstract state space for Petri nets and time Petri nets. Int J Prod Res. 2004;42(4):2741–2756. [Online]. Available from: http://www.laas.fr/tina
   Google Scholar
• Pascal M. Small Turing machines and generalized busy beaver competition. TCS. 2004;326(1–3):45–56.
   Web of Science ®Google Scholar
• Czerwinski W, Lasota S, Lazic R, et al. The reachability problem for Petri nets is not elementary. In TCS Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC2019). Vol. 2433. Jun 2019.
   Google Scholar
• Petersen J. Petri net theory and the modeling of systems. Upper Saddle River, NJ: Prentice-Hall; 1981.
   Google Scholar
• Minsky ML. Computation: finite and infinite machines. Englewood Cliffs (NJ): Prentice-Hall; 1967.
   Google Scholar
• Hopcroft J, Motwani R, Ullman J. Introduction to automata theory, languages, and computation. 3rd ed. Pearson/Addison Wesley, Boston: Pearson; 2014.
   Google Scholar
• Burkhard H-D. On priorities of parallelism: petri nets under the maximum firing strategy. LNCS Logic Progr Their Appl. 1980;148:86–97.
   Google Scholar
• Agerwala T. A complete model for representing the coordination of asynchronous processes. Baltimore (MD): John Hopkins Univ., Hopkins Comput. Sci. Prog.; Jul 1974 (Res. Rep. No. 32).
   Google Scholar
• Berthomieu B, Peres F, Vernadat F. Model checking bounded prioritized time petri nets. In Automated technology for verification and analysis. Springer; 2007. p. 523–532.
   Google Scholar
• Garg VK. Introduction to lattice theory with computer science applications. Hoboken, New Jersey: Wiley; 2015.
   Google Scholar
• Baker Jr. HG. Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems Computation Structures Group Memo 79, Project MAC, M.I.T, Cambridge, Mass, July 1973.
   Google Scholar
• Hack M. The equality problem for vector addition systems is undecidable. TCS. 1976;2(1):77–95.
   Google Scholar
• Zaitsev DA. Universal Sleptsov Net. Int J Comput Math. 2017;94(12):2396–2408.
   Web of Science ®Google Scholar
• Zaitsev DA, Zaitsev ID, Shmeleva TR. Infinite petri nets: part 1, modeling square grid structures. Compl Syst. 2017;26(2):157–195.
   Web of Science ®Google Scholar
• Cervesato I, Durgin N, Mitchell J, et al. Relating strands and multiset rewriting for security protocol analysis. In Proceedings 13th IEEE Computer Security Foundations Workshop (CSFW-13), 2000 Jul, p. 35–51.
   Google Scholar
• Zaitsev DA, Shmeleva TR, Groote JF. Verification of hypertorus communication grids by infinite Petri nets and process algebra. IEEE/CAA J Autom Sinica. 2019 May;6(3):733–742.
   Google Scholar
• Zaitsev DA, Zaitsev ID, Shmeleva TR. Infinite petri nets: part 2, modeling triangular, hexagonal, hypercube and hypertorus structures. Compl Syst. 2017;26(4):341–371.
   Web of Science ®Google Scholar
• Hillah L, Kordon F, Lakos C, et al. Extending PNML scope: a framework to combine Petri nets types. LNCS. 2012;7400:46–70.
   Google Scholar
• Lu F, Zeng Q, Zhou MC, et al. Complex reachability trees and their application to deadlock detection for unbounded petri nets. IEEE Trans Syst Man Cyber Syst. 2019 Jun;49(6):1164–1174.
   Web of Science ®Google Scholar
• Luo J, Liu Z, Zhou MC. A petri net based deadlock avoidance policy for flexible manufacturing systems with assembly operations and multiple resource acquisition. IEEE Trans Indust Inform. 2019 Jun;15(6):3379–3387.
   Web of Science ®Google Scholar
• Luo J, Liu Z, Wang S, et al. Robust deadlock avoidance policy for automated manufacturing system with multiple unreliable resources. IEEE/CAA J Auto Sinica. 2020 May;7(3):812–821.
   Google Scholar
• Xia C, Li C. Property preservation of Petri synthesis net based representation for embedded systems. IEEE/CAA J Auto Sinica. 2021 Apr;8(4):905–915.
   Google Scholar