רשת פטרי
הערות שוליים

↑  Petri, Carl Adam; Reisig, Wolfgang (2008). "Petri net". Scholarpedia. p. 6477. doi:10.4249/scholarpedia.6477.
↑  Rozenburg, G.; Engelfriet, J. (1998). "Elementary Net Systems".  In Reisig, W.; Rozenberg, G. (eds.). Lectures on Petri Nets I: Basic Models - Advances in Petri Nets. Lecture Notes in Computer Science. Vol. 1491. Springer. pp. 12–121.
↑  Reisig, Wolfgang (1991). "Petri Nets and Algebraic Specifications". Theoretical Computer Science. 80 (1): 1–34. doi:10.1016/0304-3975(91)90203-e.
↑  Desel, Jörg; Juhás, Gabriel (2001). "What Is a Petri Net? Informal Answers for the Informed Reader".  In Ehrig, Hartmut (ed.). Unifying Petri Nets. LNCS. Vol. 2128. Springerlink.com. pp. 1–25. נבדק ב-2014-05-14.(הקישור אינו פעיל)
↑  Esparza, Javier; Nielsen, Mogens (1995) [1994]. "Decidability issues for Petri nets - a survey". Bulletin of the EATCS (Revised ed.). נבדק ב-2014-05-14.
↑  Lipton, R. (1976). "The Reachability Problem Requires Exponential Space". Technical Report 62. Yale University.
↑  Küngas, P. (ביולי 26–29, 2005). Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies. Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation—SARA 2005. Airth Castle, Scotland, UK. אורכב מ-המקור ב-2012-02-09. נבדק ב-2015-07-10. {{cite conference}}:  (עזרה)
↑  Murata, Tadao (באפריל 1989). "Petri Nets: Properties, Analysis and Applications". Proceedings of the IEEE. pp. 541–558. doi:10.1109/5.24143. נבדק ב-2014-10-13. {{cite web}}:  (עזרה)
↑  "Petri Nets". www.techfak.uni-bielefeld.de.
↑  David, René; Alla, Hassane (2005). Discrete, continuous, and hybrid Petri Nets. Springer. ISBN 978-3-540-22480-8.
↑  Jensen, Kurt. "A brief introduction to colored Petri nets" (PDF). אורכב מ-המקור (PDF) ב-2005-03-13. נבדק ב-2015-07-10.
↑  Araki, T.; Kasami, T. (1977). "Some Decision Problems Related to the Reachability Problem for Petri Nets". Theoretical Computer Science. 3 (1): 85–104. doi:10.1016/0304-3975(76)90067-0.
↑  Dufourd, C.; Finkel, A.; Schnoebelen, Ph. (1998). "Reset Nets Between Decidability and Undecidability". Proceedings of the 25th International Colloquium on Automata, Languages and Programming. LNCS. Vol. 1443. pp. 103–115.
↑  Zaitsev, D. A. (2013). "Toward the Minimal Universal Petri Net". IEEE Transactions on Systems, Man, and Cybernetics: Systems. 44: 1–12. doi:10.1109/TSMC.2012.2237549.
↑  "Very Brief Introduction to CP-nets". Department of Computer Science, University of Aarhus, Denmark. אורכב מ-המקור ב-2010-10-28. נבדק ב-2015-07-10.
↑  http://llpn.com/OPNs.html
↑  Dawis, E. P.; Dawis, J. F.; Koo, Wei-Pin (2001). Architecture of Computer-based Systems using Dualistic Petri Nets. 2001 IEEE International Conference on Systems, Man, and Cybernetics. Vol. 3. pp. 1554–1558.
↑  Dawis, E. P. (2001). Architecture of an SS7 Protocol Stack on a Broadband Switch Platform using Dualistic Petri Nets. 2001 IEEE Pacific Rim Conference on Communications, Computers and signal Processing. Vol. 1. pp. 323–326.
1 2  van der Aalst, W. M. P. (1998). "The application of Petri nets to workflow management" (PDF). J of Circuits, Sys and Comput. pp. 21–66. doi:10.1142/s0218126698000043. אורכב מ-המקור (PDF) ב-2016-11-19. נבדק ב-2015-07-10.
↑  van Hee, K.; Sidorova, N.; Voorhoeve, M. (2003). "Soundness and separability of workflow nets in the stepwise refinement approach" (PDF).  In van der Aalst, W. M. P.; Best, E. (eds.). Application and Theory of Petri Nets 2003. Lect Notes in Comput Sci. Vol. 2678. Springer. pp. 337–356.
1 2  Ping, L.; Hao, H.; Jian, L. (2004).  Moldt, Daniel (ed.). On 1-soundness and soundness of workflow nets. Proc of the 3rd Workshop on Modelling of Objects, Components, and Agents. Vol. 571. Aarhus, Denmark: DAIMI PB. pp. 21–36.
↑  Karniel, A.; Reich, Y. (במאי 2011). "Formalizing a Workflow net implementation of Design-Structure-Matrix-based Process Planning for New Product Development". IEEE Transactions on Systems, Man, and Cybernetics--Part A: Systems and Humans. pp. 476–491. doi:10.1109/tsmca.2010.2091954. {{cite web}}:  (עזרה)
↑  Mazurkiewicz, Antoni (1995). "Introduction to Trace Theory".  In Diekert, V.; Rozenberg, G. (eds.). The Book of Traces. Singapore: World Scientific. pp. 3–67.
↑  Winskel, G.; Nielsen, M. "Models for Concurrency" (PDF). Handbook of Logic and the Foundations of Computer Science. Vol. 4. OUP. pp. 1–148.
| --- | --- |
בקרת זהויות :  NLI: 987007538726205171  BNE: XX548185  GND: 4045388-1  LCCN: sh85100346  NKC: ph117101 
רשת פטרי עם מעבר מאופשר.
רשת הפטרי שמתקבלת לאחר שהמעבר מופעל (רשת הפטרי התחלתית למעלה).
(ב) דוגמה לרשת פטרי
רשת פטרי שבה  t_{0} הוא מת, בעוד עבור כל  j>0,  t_{j} הוא בעל חיות  L_{j}
גרף הנגישות של N2.
רשת פטרי לא חסומה, N.
רשת פטרי חסומה-2, המתקבלת על ידי הרחבת N ב"מקומות-נגד".
המחשה גרפית של סוגי רשתות פטרי