Auswahl der wissenschaftlichen Literatur zum Thema „Petri nets“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Petri nets" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Petri nets":
Narahari, Y. „Petri nets“. Resonance 4, Nr. 9 (September 1999): 44–52. http://dx.doi.org/10.1007/bf02834232.
Narahari, Y. „Petri nets“. Resonance 4, Nr. 8 (August 1999): 58–69. http://dx.doi.org/10.1007/bf02837068.
Baez, John C., und Jade Master. „Open Petri nets“. Mathematical Structures in Computer Science 30, Nr. 3 (März 2020): 314–41. http://dx.doi.org/10.1017/s0960129520000043.
SHIIZUKA, Hisao. „Fuzzy Petri Nets“. Journal of Japan Society for Fuzzy Theory and Systems 4, Nr. 6 (1992): 1069–85. http://dx.doi.org/10.3156/jfuzzy.4.6_63.
Liu, GuanJun, ChangJun Jiang, MengChu Zhou und PengCheng Xiong. „Interactive Petri Nets“. IEEE Transactions on Systems, Man, and Cybernetics: Systems 43, Nr. 2 (März 2013): 291–302. http://dx.doi.org/10.1109/tsmca.2012.2204741.
Bartoletti, Massimo, Tiziana Cimoli und G. Michele Pinna. „Lending Petri nets“. Science of Computer Programming 112 (November 2015): 75–101. http://dx.doi.org/10.1016/j.scico.2015.05.006.
ASPERTI, A., und N. BUSI. „Mobile Petri nets“. Mathematical Structures in Computer Science 19, Nr. 6 (Dezember 2009): 1265–78. http://dx.doi.org/10.1017/s0960129509990193.
de Frutos Escrig, David, und Olga Marroquín Alonso. „Ambient Petri Nets“. Electronic Notes in Theoretical Computer Science 85, Nr. 1 (September 2003): 39. http://dx.doi.org/10.1016/s1571-0661(05)80086-6.
Bause, Falko, und Pieter S. Kritzinger. „Stochastic Petri Nets“. ACM SIGMETRICS Performance Evaluation Review 26, Nr. 2 (August 1998): 2–3. http://dx.doi.org/10.1145/288197.581194.
Eshuis, Rik. „Statechartable Petri nets“. Formal Aspects of Computing 25, Nr. 5 (24.09.2011): 659–81. http://dx.doi.org/10.1007/s00165-011-0204-5.
Dissertationen zum Thema "Petri nets":
Bowden, Fred D. J. „The modelling and analysis of command and control decision processes using extended time petri nets“. Title page, table of contents and abstract only, 2001. http://web4.library.adelaide.edu.au/theses/09PH/09phb784.pdf.
Jin, Wei. „Petri nets and their applications“. Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/774753.
Department of Computer Science
Dahlbom, Anders. „Petri nets for situation recognition“. Doctoral thesis, Örebro universitet, Akademin för naturvetenskap och teknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-13089.
Anders Dahlbom is also affiliated to Skövde Artificial Intelligence Lab (SAIL), Information Fusion Research Program, Högskolan i Skövde
David, Nicolas. „Discrete Parameters in Petri Nets“. Thesis, Nantes, 2017. http://www.theses.fr/2017NANT4108/document.
With the aim of increasing the modelling capability of Petri nets, we suggest that models involve parameters to represent the weights of arcs, or the number of tokens in places. We consider the property of coverability of markings. Two general questions arise, the universal and the existential one: “Is there a parameter value for which the property is satisfied?” and “Does the property hold for all possible values of the parameters”. We show that these issues are undecidable in the general case. Therefore, we also define subclasses of parameterised nets, depending on whether the parameters are used on places, input or output arcs of transitions. For some classes, we prove that universal and existential coverability become decidable, making these classes more usable in practice. To complete this study, we prove that those problems are EXPSPACE-complete. We also address a problem of parameter synthesis, that is computing the set of values for the parameters such that a given marking is coverable in the instantiated net. Restricting parameters to only input weights (preT-PPNs) provides a downward-closed structure to the solution set. We therefore invoke a result for the representation of upward closed set from Valk and Jantzen. The condition to use this procedure is equivalent to decide the universal coverability. We also propose an adaptation of this reasoning to the case of parameters used only as output weights (postT-PPNs). In this case, the condition to use this procedure can be reduced to the decidability of the existential coverability. Finally, we broaden this study by establishing decision frontiers through the study of existential and universal reachability
BARROSO, GIOVANNI CORDEIRO. „A STUDY ON COLORED PETRI NETS AND A PROGRAM TO ANALYZE COLORED PETRI NETS: ANARCO“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1987. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14192@1.
The modeling of sistems which have identical sub-systems, by means of Petri nets, leads to the generation of large scale graphs with identical components. The extensions of Petri nets, which afford the possibility of distinguishing these sub-systems through the distinction of the tokens within the net, are called colored Petri nets. This work presents some colored Petri net proposals existent in literature and an analysis code based on one of these proposals - the Kurt Jensen one. This program analyses through the mark enumeration method, the colored Petri net properties, such as boundedness, liveness and reinicialization.
Masapati, Gulammahammad Hasanasaheb. „Performance prediction using timed Petri nets“. Thesis, University of Ottawa (Canada), 1987. http://hdl.handle.net/10393/5155.
Kyratzoglou, I. M. (Ioannis M. ). „Computer aided design for Petri Nets“. Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14669.
Ghahremani, Azghandi Nargess. „Petri nets, probability and event structures“. Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9936.
Li, Yao Carleton University Dissertation Engineering Electrical. „Solution techniques for stochastic petri nets“. Ottawa, 1992.
MASCHERONI, MARCO. „Hypernets: a class of hierarchical petri nets“. Doctoral thesis, Università degli Studi di Milano-Bicocca, 2011. http://hdl.handle.net/10281/19228.
Bücher zum Thema "Petri nets":
Hartmut, Ehrig, Hrsg. Unifying Petri nets: Advances in Petri nets. Berlin: Springer, 2001.
Reisig, Wolfgang. Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-69968-9.
Diaz, Michel, Hrsg. Petri Nets. London, UK: ISTE, 2009. http://dx.doi.org/10.1002/9780470611647.
Liu, Guanjun. Petri Nets. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-6309-4.
Grzegorz, Rozenberg, Hrsg. Petri nets. Amsterdam: North-Holland, 1996.
1950-, Reisig Wolfgang, Rozenberg Grzegorz und Advanced Course on Petri Nets (1996 : Dagstuhl, Wadern, Germany), Hrsg. Lectures on Petri nets: Advances in Petri nets. Berlin: Springer, 1998.
Bause, Falko, und Pieter S. Kritzinger. Stochastic Petri Nets. Wiesbaden: Vieweg+Teubner Verlag, 1996. http://dx.doi.org/10.1007/978-3-663-11521-2.
Wang, Jiacun. Timed Petri Nets. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5537-7.
Reisig, Wolfgang. Understanding Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-33278-4.
Jensen, Kurt. Coloured Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-06289-0.
Buchteile zum Thema "Petri nets":
Wang, Jiacun. „Petri Nets“. In The Kluwer International Series on Discrete Event Dynamic Systems, 9–35. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5537-7_2.
Moody, John O., und Panos J. Antsaklis. „Petri Nets“. In Supervisory Control of Discrete Event Systems Using Petri Nets, 5–22. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5711-1_2.
Ştefănescu, Gheorghe. „Petri nets“. In Network Algebra, 305–19. London: Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0479-7_12.
Gorrieri, Roberto. „Petri Nets“. In Monographs in Theoretical Computer Science. An EATCS Series, 35–76. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55559-1_3.
van der Aalst, W. M. P. „Petri Nets“. In Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_817-2.
Cheung, King Sing. „Petri Nets“. In Augmented Marked Graphs, 9–30. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06428-4_2.
Cassandras, Christos G., und Stéphane Lafortune. „Petri Nets“. In Introduction to Discrete Event Systems, 225–73. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-4070-7_4.
van der Aalst, W. M. P. „Petri Nets“. In Encyclopedia of Database Systems, 2103–8. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_817.
Best, Eike, und César C. Fernández. „Petri Nets“. In Nonsequential Processes, 55–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-73483-0_3.
Leasure, Bruce, David J. Kuck, Sergei Gorlatch, Murray Cole, Gregory R. Watson, Alain Darte, David Padua et al. „Petri Nets“. In Encyclopedia of Parallel Computing, 1525–30. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_134.
Konferenzberichte zum Thema "Petri nets":
Jain, Shruti, Pradeep Naik und Sunil Bhooshan. „Petri nets“. In ICWET '10: International Conference and Workshop on Emerging Trends in Technology. New York, NY, USA: ACM, 2010. http://dx.doi.org/10.1145/1741906.1742168.
Indzhov, Hristo, Dimitar Blagoev und George Totkov. „Executable Petri Nets“. In the International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1731740.1731782.
Semenov, Alexander. „Fractal Petri nets“. In 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2017. http://dx.doi.org/10.1109/codit.2017.8102759.
Hura, Gurdeep Singh. „Petri nets (abstract)“. In the 1986 ACM fourteenth annual conference. New York, New York, USA: ACM Press, 1986. http://dx.doi.org/10.1145/324634.325331.
Letia, Tiberiu S., Elenita M. Durla-Pasca und Dahlia Al-Janabi. „Quantum Petri Nets“. In 2021 25th International Conference on System Theory, Control and Computing (ICSTCC). IEEE, 2021. http://dx.doi.org/10.1109/icstcc52150.2021.9607302.
Marzougui, Borhen, Khaled Hssine und Kamel Barkaoui. „Toward a New Model of the Petri Nets: Agent Petri Nets“. In 2010 European Modelling Symposium (EMS). IEEE, 2010. http://dx.doi.org/10.1109/ems.2010.100.
de la Hoz, Jose Daniel Fandiño, Juan Sebastián Sosa und Nicolás Cardozo. „Distributed Context Petri Nets“. In the Workshop. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3340671.3343359.
Aman, Bogdan, Gabriel Ciobanu und G. Michele Pinna. „Timed Catalytic Petri Nets“. In 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2012. http://dx.doi.org/10.1109/synasc.2012.22.
Luo, Huaiju, Jiliang Luo und Wanzhen Lin. „Reasoning via Petri nets“. In 2017 Eighth International Conference on Intelligent Control and Information Processing (ICICIP). IEEE, 2017. http://dx.doi.org/10.1109/icicip.2017.8113935.
Comlan, Maurice, David Delfieu, Medesu Sogbohossou und Antoine Vianou. „Embedding time Petri nets“. In 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2017. http://dx.doi.org/10.1109/codit.2017.8102625.
Berichte der Organisationen zum Thema "Petri nets":
Prisgrove, L. A., und G. S. Shedler. Symmetric Stochastic Petri Nets. Fort Belvoir, VA: Defense Technical Information Center, März 1985. http://dx.doi.org/10.21236/ada158348.
Clegg, Benjamin Wyatt, David H. Collins, Jr. und Aparna V. Huzurbazar. Petri Nets for Adversarial Models using Monte Carlo Simulation. Office of Scientific and Technical Information (OSTI), September 2018. http://dx.doi.org/10.2172/1473775.
Newcomb, Harry. Modeling Bus Bunching with Petri Nets and Max-Plus Algebra. Portland State University Library, Januar 2014. http://dx.doi.org/10.15760/honors.66.
Perdu, Didier M. Requirements Specification with Petri Nets Using the Cube Tool Methodology. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada212190.
Suzuki, Ichiro, Jianan Li und Masafumi Yamashita. Fair Petri Nets and Structural Induction for Rings of Processes. Fort Belvoir, VA: Defense Technical Information Center, Dezember 1994. http://dx.doi.org/10.21236/ada283920.
Shatz, S. Using Petri Nets to Support Concurrent Software Analysis and Design Automation. Fort Belvoir, VA: Defense Technical Information Center, Oktober 1999. http://dx.doi.org/10.21236/ada371497.
DiLeo, John J. Use of Petri Nets in the Simulation of Command and Control Systems. Fort Belvoir, VA: Defense Technical Information Center, Oktober 1994. http://dx.doi.org/10.21236/ada289942.
Li, Jianan, Ichiro Suzuki und Masafumi Yamashita. Decision Problems Related to Structural Induction for Rings of Petri Nets with Fairness,. Fort Belvoir, VA: Defense Technical Information Center, Oktober 1995. http://dx.doi.org/10.21236/ada297111.
Schmerl, Bradley, Jonathan Aldrich, David Garlan, Rick Kazman und Hong Yan. DiscoTect: A System for Discovering the Architectures of Running Programs using Colored Petri Nets. Fort Belvoir, VA: Defense Technical Information Center, März 2006. http://dx.doi.org/10.21236/ada456147.
Yablonskyy, Maxym. «NEW DAYS» WEEKLY AND PETRO VOLYNIAK, PUBLISHER AND AUTHOR. Ivan Franko National University of Lviv, Februar 2021. http://dx.doi.org/10.30970/vjo.2021.49.11058.