Увійти

Готові списки джерел за темами / Petri nets / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Petri nets.

Статті в журналах з теми "Petri nets"

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 25 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Petri nets".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Narahari, Y. "Petri nets." Resonance 4, no. 9 (1999): 44–52. http://dx.doi.org/10.1007/bf02834232.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Narahari, Y. "Petri nets." Resonance 4, no. 8 (1999): 58–69. http://dx.doi.org/10.1007/bf02837068.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Baez, John C., and Jade Master. "Open Petri nets." Mathematical Structures in Computer Science 30, no. 3 (2020): 314–41. http://dx.doi.org/10.1017/s0960129520000043.

Повний текст джерела

Анотація:

AbstractThe reachability semantics for Petri nets can be studied using open Petri nets. For us, an “open” Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the outputs of one to the inputs of another. Open Petri nets can be treated as morphisms of a category Open(Petri), which becomes symmetric monoidal under disjoint union. However, since the composite of open Petri nets is defined only up to isomorphism, it is better to treat them as morphisms of a symmetric monoidal double category ${\mathbb O}$ pen(Petri). W

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Finkel, Alain, Serge Haddad, and Igor Khmelnitsky. "Coverability, Termination, and Finiteness in Recursive Petri Nets." Fundamenta Informaticae 183, no. 1-2 (2022): 33–66. http://dx.doi.org/10.3233/fi-2021-2081.

Повний текст джерела

Анотація:

In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. Although Recursive Petri nets strictly extend Petri nets and context-free grammars, most of the usual problems (reachability, coverability, finiteness, boundedness and termination) were known to be solvable by using non-primitive recursive algorithms. For almost all other extended Petri nets models containing a stack, the complexity of coverability and termination are unknown or strictly larger than EXPSPACE. In c

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Badouel, Eric, Jules Chenou, and Goulven Guillou. "An Axiomatization of the Token Game Based on Petri Algebras." Fundamenta Informaticae 77, no. 3 (2007): 187–215. https://doi.org/10.3233/fun-2007-77301.

Повний текст джерела

Анотація:

The firing rule of Petri nets relies on a residuation operation for the commutative monoid of non negative integers. We identify a class of residuated commutative monoids, called Petri algebras, for which one can mimic the token game of Petri nets to define the behaviour of generalized Petri nets whose flow relations and place contents are valued in such algebraic structures. The sum and its associated residuation capture respectively how resources within places are produced and consumed through the firing of a transition. We show that Petri algebras coincide with the positive cones of lattice

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Ma, Zongmin, Haitao Cheng, and Li Yan. "Automatic Construction of OWL Ontologies From Petri Nets." International Journal on Semantic Web and Information Systems 15, no. 1 (2019): 21–51. http://dx.doi.org/10.4018/ijswis.2019010102.

Повний текст джерела

Анотація:

Ontology, as a formal representation method of domain knowledge, plays a particular important key role in semantic web. How to construct ontologies has become a key technology in the semantic web, especially constructing ontologies from existing domain knowledge. Currently, Petri nets have been a mathematical modeling tool, and have been widely studied and successfully applied in modeling of software engineering, database and artificial intelligence. In particular, PNML (Petri Net Markup Language) language has been a part of ISO/IEC Petri nets standard for representing and exchanging data on P

Стилі APA, Harvard, Vancouver, ISO та ін.

7

SHIIZUKA, Hisao. "Fuzzy Petri Nets." Journal of Japan Society for Fuzzy Theory and Systems 4, no. 6 (1992): 1069–85. http://dx.doi.org/10.3156/jfuzzy.4.6_63.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Liu, GuanJun, ChangJun Jiang, MengChu Zhou, and PengCheng Xiong. "Interactive Petri Nets." IEEE Transactions on Systems, Man, and Cybernetics: Systems 43, no. 2 (2013): 291–302. http://dx.doi.org/10.1109/tsmca.2012.2204741.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Bartoletti, Massimo, Tiziana Cimoli, and 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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

ASPERTI, A., and N. BUSI. "Mobile Petri nets." Mathematical Structures in Computer Science 19, no. 6 (2009): 1265–78. http://dx.doi.org/10.1017/s0960129509990193.

Повний текст джерела

Анотація:

We add mobility to Place-Transition Petri nets: tokens are names for places, and an input token of a transition can be used in its postset to specify a destination. Mobile Petri nets are then further extended to dynamic nets by adding the possibility of creating new nets during the firing of a transition. In this way, starting from Petri nets, we define a simple hierarchy of nets with increasing degrees of dynamicity. For each class in this hierarchy, we provide its encoding in the former class.Our work was largely inspired by the join-calculus of Fournet and Gonthier, which turns out to be a

Стилі APA, Harvard, Vancouver, ISO та ін.

11

de Frutos Escrig, David, and Olga Marroquín Alonso. "Ambient Petri Nets." Electronic Notes in Theoretical Computer Science 85, no. 1 (2003): 39. http://dx.doi.org/10.1016/s1571-0661(05)80086-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Bause, Falko, and Pieter S. Kritzinger. "Stochastic Petri Nets." ACM SIGMETRICS Performance Evaluation Review 26, no. 2 (1998): 2–3. http://dx.doi.org/10.1145/288197.581194.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Eshuis, Rik. "Statechartable Petri nets." Formal Aspects of Computing 25, no. 5 (2011): 659–81. http://dx.doi.org/10.1007/s00165-011-0204-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Haddad, Serge, and Denis Poitrenaud. "Recursive Petri nets." Acta Informatica 44, no. 7-8 (2007): 463–508. http://dx.doi.org/10.1007/s00236-007-0055-y.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Cardoso, J., R. Valette, and D. Dubois. "Possibilistic Petri nets." IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 29, no. 5 (1999): 573–82. http://dx.doi.org/10.1109/3477.790440.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Jensen, Kurt, and Lars M. Kristensen. "Colored Petri nets." Communications of the ACM 58, no. 6 (2015): 61–70. http://dx.doi.org/10.1145/2663340.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Ramírez-Treviño, A., C. R. Vázquez, I. Paniagua, and G. Vázquez. "Quotient Petri nets*." IFAC-PapersOnLine 55, no. 28 (2022): 315–21. http://dx.doi.org/10.1016/j.ifacol.2022.10.360.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Fűr, Attila. "Extended knowledge attributed Petri Nets." International Journal of Modeling, Simulation, and Scientific Computing 05, no. 02 (2014): 1350028. http://dx.doi.org/10.1142/s1793962313500281.

Повний текст джерела

Анотація:

Choosing the best way for describing physical reality has always been standing in focus of research. Several methodologies have been developed based on classical mathematics, or statistics and also new disciplines — such as soft-computing techniques — appeared. Petri Nets as one of the most naturalistic modeling methodologies are well suited to describe complex process in general. However in some fields of modeling the describing power of basic Petri Nets proved not to be robust enough, therefore several extensions were made to the original concept. Colored tokens (Colored Petri Nets), stochas

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Jitsukawa, Mitsuru, Pauline N. Kawamoto, and Yasunari Shidama. "Formulation of Cell Petri Nets." Formalized Mathematics 21, no. 4 (2013): 241–47. http://dx.doi.org/10.2478/forma-2013-0026.

Повний текст джерела

Анотація:

Abstract Based on the Petri net definitions and theorems already formalized in the Mizar article [13], in this article we were able to formalize the definition of cell Petri nets. It is based on [12]. Colored Petri net has already been defined in [11]. In addition, the conditions of the firing rule and the colored set to this definition, that defines the cell Petri nets are further extended to CPNT.i further. The synthesis of two Petri nets was introduced in [11] and in this work the definition is extended to produce the synthesis of a family of colored Petri nets. Specifically, the extension

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Dworza´nski, L. W., and I. A. Lomazova. "CPN Tools-Assisted Simulation and Verification of Nested Petri Nets." Modeling and Analysis of Information Systems 19, no. 5 (2015): 115–30. http://dx.doi.org/10.18255/1818-1015-2012-5-115-130.

Повний текст джерела

Анотація:

Nested Petri nets (NP-nets) are an extension of Petri net formalism within the “netswithin-nets” approach, when tokens in a marking are Petri nets, which have an autonomous behavior and are synchronized with the system net. The formalism of NP-nets allows modeling multi-level multi-agent systems with dynamic structure in a natural way. Currently, there is no tool for supporting NP-nets simulation and analysis. The paper proposes the translation of NP-nets into Colored Petri nets and the use of CPN Tools as a virtual machine for NP-nets modeling, simulation and automatic verification.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Wegener, Jan-Thierry, and Louchka Popova-Zeugmann. "Petri Nets with Time Windows: A Comparison to Classical Petri Nets." Fundamenta Informaticae 93, no. 1-3 (2009): 337–52. http://dx.doi.org/10.3233/fi-2009-0106.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Signoret, Jean-Pierre, Yves Dutuit, Pierre-Joseph Cacheux, Cyrille Folleau, Stéphane Collas, and Philippe Thomas. "Make your Petri nets understandable: Reliability block diagrams driven Petri nets." Reliability Engineering & System Safety 113 (May 2013): 61–75. http://dx.doi.org/10.1016/j.ress.2012.12.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Petrosyan, G. R., L. A. Ter-Vardanyan, and A. V. Gaboutchian. "MODELING OF BIOMETRIC IDENTIFICATION SYSTEM USING THE COLORED PETRI NETS." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-5/W6 (May 18, 2015): 37–42. http://dx.doi.org/10.5194/isprsarchives-xl-5-w6-37-2015.

Повний текст джерела

Анотація:

In this paper we present a model of biometric identification system transformed into Petri Nets. Petri Nets, as a graphical and mathematical tool, provide a uniform environment for modelling, formal analysis, and design of discrete event systems. The main objective of this paper is to introduce the fundamental concepts of Petri Nets to the researchers and practitioners, both from identification systems, who are involved in the work in the areas of modelling and analysis of biometric identification types of systems, as well as those who may potentially be involved in these areas. In addition, t

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Siewe, François, Vasileios Germanos, and Wen Zeng. "Mapping Petri Nets onto a Calculus of Context-Aware Ambients." Software 3, no. 3 (2024): 284–309. http://dx.doi.org/10.3390/software3030015.

Повний текст джерела

Анотація:

Petri nets are a graphical notation for describing a class of discrete event dynamic systems whose behaviours are characterised by concurrency, synchronisation, mutual exclusion and conflict. They have been used over the years for the modelling of various distributed systems applications. With the advent of pervasive systems and the Internet of Things, the Calculus of Context-aware Ambients (CCA) has emerged as a suitable formal notation for analysing the behaviours of these systems. In this paper, we are interested in comparing the expressive power of Petri nets to that of CCA. That is, can t

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Rueda, Karen Hernández. "APPLICATIONS OF PETRI NETS PETRI NET APPLICATIONS." Scientific Journal of Applied Social and Clinical Science 3, no. 34 (2023): 2–10. http://dx.doi.org/10.22533/at.ed.2163342314122.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Samuel, Kile, A., Eneh, A. Hyacinth, and Tumenayu, O. Ofut. "Farm Processes Workflow Management Using Colored Petri Nets." International Journal of Computer Science and Mobile Computing 12, no. 6 (2023): 76–86. http://dx.doi.org/10.47760/ijcsmc.2023.v12i06.009.

Повний текст джерела

Анотація:

Farming majorly produces food and serves as a means of livelihood for smallholder farmers. But of lately, crop production has been on the decline. One of the reasons is due to improper farm processes management and coordination. Technological approaches can be applied towards enhancing farm process management and coordination workflow. In this study, colored petri nets are used in coordinating and managing farm processes workflow. The workflow coordination considered resources available and time for each farm process. The petri nets are analyzed and simulated using various farm processes as tr

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Zaitsev, D. A. "Verification of Computing Grids with Special Edge Conditions by Infinite Petri Nets." Modeling and Analysis of Information Systems 19, no. 6 (2015): 21–33. http://dx.doi.org/10.18255/1818-1015-2012-6-21-33.

Повний текст джерела

Анотація:

A technique of the computing grid verification using invariants of infinite Petri nets was presented. Models of square grid structures in the form of parametric Petri nets for such edge conditions as connection of edges and truncated devices were constructed. Infinite systems of linear algebraic equations were composed on parametric Petri nets for calculating p-invariants; their parametric solutions were obtained. P-invariant Petri nets are structuraly conservative and bounded that together with liveness are the properties of ideal systems. Liveness investigation based on siphons and traps can

Стилі APA, Harvard, Vancouver, ISO та ін.

28

YANG, STEPHEN J. H., and CHYUN-CHYI CHEN. "A PETRI-NETS-BASED APPROACH FOR WORKFLOW AND PROCESS AUTOMATION." International Journal on Artificial Intelligence Tools 08, no. 02 (1999): 193–205. http://dx.doi.org/10.1142/s0218213099000130.

Повний текст джерела

Анотація:

Based on the workflow management coalition (WFMC) standard and component software technologies, this paper addresses our Petri-nets-based approach for workflow and process automation. Petri nets provide graphical and mathematical formalisms for work-flow process definition and analysis. In this paper, we will present how to use Petri nets and a toolkit NCUPN (National Central University Petri Nets toolkit) for process definition and analysis. NCUPN is a Petri nets modeling and analysis toolkit developed to help software engineers in drawing and doing analysis. Once a workflow process is drawn

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Srivastava, Arun K., and S. P. Tiwari. "On Categories of Fuzzy Petri Nets." Advances in Fuzzy Systems 2011 (2011): 1–5. http://dx.doi.org/10.1155/2011/812040.

Повний текст джерела

Анотація:

We introduce the concepts of fuzzy Petri nets and marked fuzzy Petri nets along with their appropriate morphisms, which leads to two categories of such Petri nets. Some aspects of the internal structures of these categories are then explored, for example, their reflectiveness/coreflectiveness and symmetrical monoidal closed structure.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Jedlička, Petr. "XML format for notation of object-oriented Petri net." Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis 55, no. 3 (2007): 47–56. http://dx.doi.org/10.11118/actaun200755030047.

Повний текст джерела

Анотація:

Petri nets provide executive facilities for simulation of causality, non-determinism and parallelism in discreet systems. Since they are a mathematical model in substance, they offer theory, which can be successfully used to verification of models. Executability of Petri nets predestinates them for simulation and fast prototyping. Object Petri nets represent rather complicated class, based on hierarchical and high-level Petri nets. However their complexity is balanced by their ability to identify significant characteristics of system model and to visualize it in a graphic representation.Tools

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Flochová, Jana, and Tomáš Lojan. "Supervisors of Petri Nets." Research Papers Faculty of Materials Science and Technology Slovak University of Technology 27, no. 45 (2019): 33–41. http://dx.doi.org/10.2478/rput-2019-0023.

Повний текст джерела

Анотація:

Abstract The design and operation of modern industrial systems require modeling and analysis in order to select the optimal design alternative and operational policy. Discrete event system models are encountered in a variety of fields, for example computers, communication networks, manufacturing systems, sensors or actuators, faults diagnosis, robotics and traffic. The paper describes principles and methods of supervisory control of discrete event systems initiated by Ramadge and Wonham. Three supervisory control methods based on the Petri net models are introduced, and the key features of the

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Markov, Aleksandr. "Properties inversion Petri nets." Transaction of Scientific Papers of the Novosibirsk State Technical University, no. 4 (December 10, 2014): 139–52. http://dx.doi.org/10.17212/2307-6879-2014-4-139-152.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Menezes, P. Blauth, and J. Félix Costa. "SYNCHRONIZATION IN PETRI NETS." Fundamenta Informaticae 26, no. 1 (1996): 11–22. http://dx.doi.org/10.3233/fi-1996-2612.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Esparza, Javier, Martin Leucker, and Maximilian Schlund. "Learning Workflow Petri Nets." Fundamenta Informaticae 113, no. 3-4 (2011): 205–28. http://dx.doi.org/10.3233/fi-2011-607.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Meimei Gao, MengChu Zhou, Xiaoguang Huang, and Zhiming Wu. "Fuzzy reasoning petri nets." IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 33, no. 3 (2003): 314–24. http://dx.doi.org/10.1109/tsmca.2002.804362.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Prisgrove, Lindsay A., and Gerald S. Shedler. "Symmetric stochastic Petri nets." IBM Journal of Research and Development 30, no. 3 (1986): 278–93. http://dx.doi.org/10.1147/rd.303.0278.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

van Hee, Kees, Alexander Serebrenik, and Natalia Sidorova. "Token History Petri Nets." Fundamenta Informaticae 85, no. 1-4 (2008): 219–34. https://doi.org/10.3233/fun-2008-851-416.

Повний текст джерела

Анотація:

State of the art information system commonly record events in log files, also known as audit trails. Moreover, business processes often go beyond the sole recording the events and base decisions on the events observed in the past. To model such processes we extend the basic Petri net framework with the notion of history by associating tokens with histories, adding guards evaluated on the history to the transitions and mapping arcs to expressions involving histories. Guards and arc expressions can involve data associated with the transitions.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Keller, Walter. "Clustering for Petri nets." Theoretical Computer Science 308, no. 1-3 (2003): 145–97. http://dx.doi.org/10.1016/s0304-3975(02)00597-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Pedrycz, Witold, and Heloisa Camargo. "Fuzzy timed Petri nets." Fuzzy Sets and Systems 140, no. 2 (2003): 301–30. http://dx.doi.org/10.1016/s0165-0114(02)00524-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Caradec, Muriel, and Françis Prunet. "Coloured Batches Petri Nets." IFAC Proceedings Volumes 30, no. 19 (1997): 227–32. http://dx.doi.org/10.1016/s1474-6670(17)42303-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Best, Eike, Raymond Devillers, and Maciej Koutny. "Recursion and Petri nets." Acta Informatica 37, no. 11 (2001): 781–829. http://dx.doi.org/10.1007/pl00013309.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Haas, P. J., and G. S. Shedler. "Regenerative stochastic Petri nets." Computer Compacts 4, no. 5 (1986): 183. http://dx.doi.org/10.1016/0167-7136(86)90041-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Haas, Peter J., and Gerald S. Shedler. "Regenerative stochastic Petri nets." Performance Evaluation 6, no. 3 (1986): 189–204. http://dx.doi.org/10.1016/0166-5316(86)90017-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Le Bail, Jean, Hassane Alla, and René David. "Asymptotic continuous Petri nets." Discrete Event Dynamic Systems 2, no. 3-4 (1993): 235–63. http://dx.doi.org/10.1007/bf01797160.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Nathan, M., and S. E. Tavares. "Petri nets for classification." Electronics Letters 28, no. 10 (1992): 965–66. http://dx.doi.org/10.1049/el:19920612.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Trivedi, Kishor S., A. Bobbio, G. Ciardo, R. German, A. Puliafito, and M. Telek. "Non-Markovian Petri nets." ACM SIGMETRICS Performance Evaluation Review 23, no. 1 (1995): 263–64. http://dx.doi.org/10.1145/223586.223616.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Domenici, Andrea. "Petri nets in logic." Microprocessing and Microprogramming 30, no. 1-5 (1990): 193–98. http://dx.doi.org/10.1016/0165-6074(90)90239-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Meseguer, José, and Ugo Montanari. "Petri nets are monoids." Information and Computation 88, no. 2 (1990): 105–55. http://dx.doi.org/10.1016/0890-5401(90)90013-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Garavel, Hubert. "Nested-unit Petri nets." Journal of Logical and Algebraic Methods in Programming 104 (April 2019): 60–85. http://dx.doi.org/10.1016/j.jlamp.2018.11.005.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Pagnoni, Anastasia. "Error-correcting Petri nets." Natural Computing 10, no. 2 (2009): 711–25. http://dx.doi.org/10.1007/s11047-009-9150-z.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!