Zeitschriftenartikel: „Petri nets“

1

Narahari, Y. „Petri nets“. Resonance 4, Nr. 9 (September 1999): 44–52. http://dx.doi.org/10.1007/bf02834232.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Narahari, Y. „Petri nets“. Resonance 4, Nr. 8 (August 1999): 58–69. http://dx.doi.org/10.1007/bf02837068.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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.

Der volle Inhalt der Quelle

Annotation:

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). We describe two forms of semantics for open Petri nets using symmetric monoidal double functors out of ${\mathbb O}$ pen(Petri). The first, an operational semantics, gives for each open Petri net a category whose morphisms are the processes that this net can carry out. This is done in a compositional way, so that these categories can be computed on smaller subnets and then glued together. The second, a reachability semantics, simply says which markings of the outputs can be reached from a given marking of the inputs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

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.

Der volle Inhalt der Quelle

Annotation:

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 (well-motivated) particular case of dynamic Petri nets. The main difference is that, in the preset of a transition, we allow both non-linear patterns (name unification) and (locally) free names for input places (that is, we remove the locality constraint, and preserve reflexion).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Haddad, Serge, und Denis Poitrenaud. „Recursive Petri nets“. Acta Informatica 44, Nr. 7-8 (11.09.2007): 463–508. http://dx.doi.org/10.1007/s00236-007-0055-y.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Jensen, Kurt, und Lars M. Kristensen. „Colored Petri nets“. Communications of the ACM 58, Nr. 6 (21.05.2015): 61–70. http://dx.doi.org/10.1145/2663340.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

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

Der volle Inhalt der Quelle

Annotation:

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 contrast, we establish here that for Recursive Petri nets, the coverability, termination, boundedness and finiteness problems are EXPSPACE-complete as for Petri nets. From an expressiveness point of view, we show that coverability languages of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. Thus we get a more powerful model than Petri net for free.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

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

Der volle Inhalt der Quelle

Annotation:

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 Petri nets. Therefore, how to construct ontologies from PNML model of Petri nets needs to be investigated. In this article, the authors investigate a method for automatic construction of web ontology language (OWL) ontologies from PNML of Petri nets. Firstly, this paper gives a formal definition and the semantics of PNML models of Petri nets. On this basis, a formal approach for constructing OWL ontologies from PNML model of Petri nets is proposed, i.e., this paper transforms Petri nets (including PNML model and PNML document of the Petri nets) into OWL ontologies at both structure and instance levels. Furthermore, the correctness of the transformation is proved. Finally, a prototype construction tool called PN2OWL is developed to transform Petri nets models into OWL ontologies automatically.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

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

Der volle Inhalt der Quelle

Annotation:

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), stochastic delayed streaming of mobile entities (Stochastic Petri Nets), object oriented architecture (Object Oriented Petri Nets), numerical (Numerical Petri Nets) and linguistic attributes (Fuzzy Petri Nets) broaden the range of capabilities. In some fields of problem solving, usage of static and mobile knowledge bases is needed: e.g., flexible manufacturing systems, or intelligent traffic simulation. These problems to be investigated involved new conceptual developments of Petri Nets and led to the introduction of Knowledge Attributed Petri Nets. At the same time distributed control in simulation appeared, intelligent agents supported the connection of mobile knowledge bases and static inference engines in an effective way. The mentioned extensions brought general support in model synthesis, but some unsolved questions remained related to the implementation of intelligent mobile entities. This paper highlights a new level of AI controlled simulation introducing the Extended Knowledge Attributed Petri Nets that offer the capability of easy implementation of mobile inference engines and knowledge base, providing general mobile AI in Petri Nets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

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

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

19

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

Der volle Inhalt der Quelle

Annotation:

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 to a CPNT family is performed by specifying how to link the outbound transitions of each colored Petri net to the place elements of other nets to form a neighborhood relationship. Finally, the activation of colored Petri nets was formalized.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

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

Der volle Inhalt der Quelle

Annotation:

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 the class of systems represented by Petri nets be modelled in CCA? To answer this question, an algorithm is proposed that maps any Petri net onto a CCA process. We prove that a Petri net and its corresponding CCA process are behavioural equivalent. It follows that CCA is at least as expressive as Petri nets, i.e., any system that can be specified in Petri nets can also be specified in CCA. Moreover, tools developed for CCA can also be used to analyse the behaviours of Petri nets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Petrosyan, G. R., L. A. Ter-Vardanyan und 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 (18.05.2015): 37–42. http://dx.doi.org/10.5194/isprsarchives-xl-5-w6-37-2015.

Der volle Inhalt der Quelle

Annotation:

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, the paper introduces high-level Petri Nets, as Colored Petri Nets (CPN). In this paper the model of Colored Petri Net describes the identification process much simpler.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

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

Der volle Inhalt der Quelle

Annotation:

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 transitions in the colored petri nets. The analysis and simulation of the petri nets was done using Petri Nets Simulator and proved the correctness property of colored petri nets which has liveness, reachability and boundedness as characteristics. This shows that farm processes workflow coordination is a crucial step in farming systems and should be properly done as it leads to increased crop yields by smallholder farmers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

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

Der volle Inhalt der Quelle

Annotation:

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 be implemented by using p-invariants of modified nets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

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

Der volle Inhalt der Quelle

Annotation:

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 Petri tool software application for the supervisory control of discrete event systems modeled by Petri nets are highlighted.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Nathan, M., und S. E. Tavares. „Petri nets for classification“. Electronics Letters 28, Nr. 10 (07.05.1992): 965–66. http://dx.doi.org/10.1049/el:19920612.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

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

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Nielsen, Mogens, und Glynn Winskel. „Petri nets and bisimulation“. Theoretical Computer Science 153, Nr. 1-2 (Januar 1996): 211–44. http://dx.doi.org/10.1016/0304-3975(95)00122-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Zaitsev, D. A. „Decomposition of Petri nets“. Cybernetics and Systems Analysis 40, Nr. 5 (September 2004): 739–46. http://dx.doi.org/10.1007/s10559-005-0012-0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Crazzolara, Federico, und Glynn Winskel. „Petri Nets With Persistence“. Electronic Notes in Theoretical Computer Science 121 (Februar 2005): 143–55. http://dx.doi.org/10.1016/j.entcs.2004.10.012.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Ehrig, H., K. Hoffmann und J. Padberg. „Transformations of Petri Nets“. Electronic Notes in Theoretical Computer Science 148, Nr. 1 (Februar 2006): 151–72. http://dx.doi.org/10.1016/j.entcs.2005.12.016.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Ermakova, V. O., und I. A. Lomazova. „Translation of Nested Petri Nets into Classical Petri Nets for Unfoldings Verification“. Proceedings of the Institute for System Programming of the RAS 28, Nr. 4 (2016): 115–36. http://dx.doi.org/10.15514/ispras-2016-28(4)-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zeitschriftenartikel zum Thema „Petri nets“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an