רשת פטרי (Hebrew Wikipedia)

Analysis of information sources in references of the Wikipedia article "רשת פטרי" in Hebrew language version.

refsWebsite

Global rank Hebrew rank

7doi.org

2^nd place

10^th place

4web.archive.org

1^st place

6^th place

2psu.edu

207^th place

644^th place

2au.dk

8,222^nd place

6,504^th place

2tue.nl

9,054^th place

7,021^st place

1scholarpedia.org

low place

4,210^th place

1springerlink.com

2,569^th place

733^rd place

1ntnu.no

7,215^th place

9,979^th place

1uic.edu

5,752^nd place

1,056^th place

1uni-bielefeld.de

9,437^th place

999^th place

1books.google.com

3^rd place

33^rd place

1uio.no

2,613^th place

2,729^th place

1llpn.com

low place

1ieee.org

652^nd place

820^th place

au.dk

daimi.au.dk

"Very Brief Introduction to CP-nets". Department of Computer Science, University of Aarhus, Denmark. אורכב מ-המקור ב-2010-10-28. נבדק ב-2015-07-10.
Winskel, G.; Nielsen, M. "Models for Concurrency" (PDF). Handbook of Logic and the Foundations of Computer Science. Vol. 4. OUP. pp. 1–148.

books.google.com

David, René; Alla, Hassane (2005). Discrete, continuous, and hybrid Petri Nets. Springer. ISBN 978-3-540-22480-8.

doi.org

Petri, Carl Adam; Reisig, Wolfgang (2008). "Petri net". Scholarpedia. p. 6477. doi:10.4249/scholarpedia.6477.
Reisig, Wolfgang (1991). "Petri Nets and Algebraic Specifications". Theoretical Computer Science. 80 (1): 1–34. doi:10.1016/0304-3975(91)90203-e.
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}}: (עזרה)
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.
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.
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.
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}}: (עזרה)

ieee.org

ieeexplore.ieee.org

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}}: (עזרה)

llpn.com

http://llpn.com/OPNs.html

ntnu.no

idi.ntnu.no

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}}: (עזרה)

psu.edu

citeseer.ist.psu.edu

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.

scholarpedia.org

Petri, Carl Adam; Reisig, Wolfgang (2008). "Petri net". Scholarpedia. p. 6477. doi:10.4249/scholarpedia.6477.

springerlink.com

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.(הקישור אינו פעיל)

tue.nl

wwwis.win.tue.nl

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.

win.tue.nl

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.

uic.edu

cs.uic.edu

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}}: (עזרה)

uio.no

heim.ifi.uio.no

Jensen, Kurt. "A brief introduction to colored Petri nets" (PDF). אורכב מ-המקור (PDF) ב-2005-03-13. נבדק ב-2015-07-10.

uni-bielefeld.de

techfak.uni-bielefeld.de

"Petri Nets". www.techfak.uni-bielefeld.de.

web.archive.org

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}}: (עזרה)
Jensen, Kurt. "A brief introduction to colored Petri nets" (PDF). אורכב מ-המקור (PDF) ב-2005-03-13. נבדק ב-2015-07-10.
"Very Brief Introduction to CP-nets". Department of Computer Science, University of Aarhus, Denmark. אורכב מ-המקור ב-2010-10-28. נבדק ב-2015-07-10.
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.