Relevant bibliographies by topics / Petri nets

Academic literature on the topic 'Petri nets'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Petri nets.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Journal articles on the topic "Petri nets":

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
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.
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
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).
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Petri nets' for particular source types:
Journal articles Dissertations / Theses Books

Dissertations / Theses on the topic "Petri nets":

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Bibliography: leaves 177-191. This thesis uses a new type of extended time Petri net to model and analyse command and control decision processes. A comprehensive review of existing time Petri net structures is given. This concludes with the introduction of time Petri net structure that incorporates the most commonly used time structures. This extended time Petri net structure is then used in the definition of the basic modelling blocks required to model command and control decision processes. This basic modelling block forms the basis of the direct analysis techniques that are introduced in the thesis.
2

Jin, Wei. "Petri nets and their applications." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/774753.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net theory in 1962. A substantial amount of work utilizing and modifying the Petri nets has been done since then, and they have turned out to be very useful in the study of asynchronous concurrent systems. The liveness and reachability problems are considered to be some of the major problems in Petri net theory.Since the structure of a Petri net can be regarded as sets of places and transitions form a graphical point of view, this thesis is concerned with utilizing the results of graph theory to investigate the liveness in terms of deadlock problems of a special subclass of Petri nets, free-choice Petri nets. As a subclass of Petri nets, the class of free-choice Petri nets possesse relatively strong analysis properties. This is especially true of complete free-choice Petri nets. We show in particular that any system which can be modeled by a general Petri net can also be modeled by a free-choice Petri net.
Department of Computer Science
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Situation recognition is a process with the goal of identifying a priori defined situations in a flow of data and information. The purpose is to aid decision makers with focusing on relevant information by filtering out situations of interest. This is an increasingly important and non trivial problem to solve since the amount of information in various decision making situations constantly grow. Situation recognition thus addresses the information gap, i.e. the problem of finding the correct information at the correct time. Interesting situations may also evolve over time and they may consist of multiple participating objects and their actions. This makes the problem even more complex to solve. This thesis explores situation recognition and provides a conceptualization and a definition of the problem, which allow for situations of partial temporal definition to be described. The thesis then focuses on investigating how Petri nets can be used for recognising situations. Existing Petri net based approaches for recognition have some limitations when it comes to fulfilling requirements that can be put on solutions to the situation recognition problem. An extended Petri net based technique that addresses these limitations is therefore introduced. It is shown that this technique can be as efficient as a rule based techniques using the Rete algorithm with extensions for explicitly representing temporal constraints. Such techniques are known to be efficient; hence, the Petri net based technique is efficient too. The thesis also looks at the problem of learning Petri net situation templates using genetic algorithms. Results points towards complex dynamic genome representations as being more suited for learning complex concepts, since these allow for promising solutions to be found more quickly compared with classical bit string based representations. In conclusion, the extended Petri net based technique is argued to offer a viable approach for situation recognition since it: (1) can achieve good recognition performance, (2) is efficient with respect to time, (3) allows for manually constructed situation templates to be improved and (4) can be used with real world data to find real world situations.

Anders Dahlbom is also affiliated to Skövde Artificial Intelligence Lab (SAIL), Information Fusion Research Program, Högskolan i Skövde

4

David, Nicolas. "Discrete Parameters in Petri Nets." Thesis, Nantes, 2017. http://www.theses.fr/2017NANT4108/document.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Afin de permettre une modélisation plus souple des systèmes, nous proposons d’étendre les réseaux de Petri par des paramètres discrets représentant le poids des arcs ou le nombre de jetons présents dans les places. Dans ce modèle, tout problème de décision peut être décliné sous deux versions, une universelle, demandant si la propriété considérée est vraie quelles que soient les valeurs que prennent les paramètres et une existentielle, qui s’interroge sur l’existence d’une valeur pour les paramètres telle que la propriété soit satisfaite. Concernant la couverture, nous montrons que ces deux problèmes sont indécidables dans le cas général. Nous introduisons donc des sous classes syntaxiques basées sur la restriction des paramètres aux places, aux arcs en sortie ou aux arcs en entrée des transitions. Dans ces différents cas, nous montrons que la couverture existentielle et universelle sont décidables et EXPSPACE-complètes. Nous étudions alors le problème de la synthèse de paramètres qui s’intéresse à calculer l’ensemble des valeurs de paramètres telles que la propriété considérée soit vraie. Sur les sous classes introduites, concernant la couverture, nous montrons que les ensembles solutions à la synthèse ont des structures fermée supérieurement (cas des arcs de sortie) et fermée inférieurement (cas des arcs d’entrée). Nous prouvons alors que ces ensembles se calculent par un algorithme de la littérature, proposé par Valk et Jantzen, dont les conditions d’application se réduisent aux problèmes de décision étudiés précédemment. Enfin nous étudions les frontières de décision en nous intéressant aux versions paramétrées de l’accessibilité pour ces sous classes
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
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
A modelagem de sistemas que apresentam subsistemas idênticos, por intermédio de Redes de Petri, conduz à geração de grafos de grandes dimensões com diversos componentes indênticos. As extensões às Redes de Petri que permitem diferenciar estes diversos subsistemas, por intermédio da distinção das fichas nelas contidas, receberam o nome de Redes de Petri Coloridas. Neste trabalho, são apresentados algumas propostas existentes na literatura sobre Redes de Petri Coloridas, bem como é desenvolvido um programa de análise baseado em uma dessas propostas - a de kurt Jensen. O programa analisa as propriedades de uma Rede de Petri Colorida, tais como limitação, vitalidade e capacidade de reinicialização, através do método de enumeração de marcações.
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.
6

Masapati, Gulammahammad Hasanasaheb. "Performance prediction using timed Petri nets." Thesis, University of Ottawa (Canada), 1987. http://hdl.handle.net/10393/5155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kyratzoglou, I. M. (Ioannis M. ). "Computer aided design for Petri Nets." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14669.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ghahremani, Azghandi Nargess. "Petri nets, probability and event structures." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9936.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Models of true concurrency have gained a lot of interest over the last decades as models of concurrent or distributed systems which avoid the well-known problem of state space explosion of the interleaving models. In this thesis, we study such models from two perspectives. Firstly, we study the relation between Petri nets and stable event structures. Petri nets can be considered as one of the most general and perhaps wide-spread models of true concurrency. Event structures on the other hand, are simpler models of true concurrency with explicit causality and conflict relations. Stable event structures expand the class of event structures by allowing events to be enabled in more than one way. While the relation between Petri nets and event structures is well understood, the relation between Petri nets and stable event structures has not been studied explicitly. We define a new and more compact unfoldings of safe Petri nets which is directly translatable to stable event structures. In addition, the notion of complete finite prefix is defined for compact unfoldings, making the existing model checking algorithms applicable to them. We present algorithms for constructing the compact unfoldings and their complete finite prefix. Secondly, we study probabilistic models of true concurrency. We extend the definition of probabilistic event structures as defined by Abbes and Benveniste to a newly defined class of stable event structures, namely, jump-free stable event structures arising from Petri nets (characterised and referred to as net-driven). This requires defining the fundamental concept of branching cells in probabilistic event structures, for jump-free net-driven stable event structures, and by proving the existence of an isomorphism among the branching cells of these systems, we show that the latter benefit from the related results of the former models. We then move on to defining a probabilistic logic over probabilistic event structures (PESL). To our best knowledge, this is the first probabilistic logic of true concurrency. We show examples of expressivity achieved by PESL, which in particular include properties related to synchronisation in the system. This is followed by the model checking algorithm for PESL for finite event structures. Finally, we present a logic over stable event structures (SEL) along with an account of its expressivity and its model checking algorithm for finite stable event structures.
9

Li, Yao Carleton University Dissertation Engineering Electrical. "Solution techniques for stochastic petri nets." Ottawa, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

MASCHERONI, MARCO. "Hypernets: a class of hierarchical petri nets." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2011. http://hdl.handle.net/10281/19228.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The interest of this thesis is on modeling systems of mobile agents, systems composed of several open and autonomous components which can interact and move inside one or more environments. Several proposal for modeling mobility have been introduced. They can be roughly divided in two categories: Petri net based formalisms, and process algebra based formalisms. In this thesis, Petri net formalisms will mostly be considered, with particular care to formalisms which use the nets-within-nets paradigm. In models compliant to this paradigm the tokens of a Petri net can be nets themselves. Since systems of mobile agents exhibit a nesting structure, it seems natural to use this paradigm. In particular, the focus of this dissertation is on the hypernet model, whose main characteristic is that it has a limited state space, characteristic that make it suitable to be analyzed using well known Petri net techniques. The thesis topics range from theoretical aspects of the model to more practical issues. From a theoretical point of view an extension of the model is introduced. It is proved that this extension preserves all the good properties of the basic model. It is also studied how to apply the well known unfolding technique to this model. From a practical point of view is is shown how the nets-within nets paradigm can be used to model systems based on the Grid infrastructure. Moreover, a tool which allow to draw and to analyze an hypernet is discussed.
More sources

Books on the topic "Petri nets":

1

Hartmut, Ehrig, ed. Unifying Petri nets: Advances in Petri nets. Berlin: Springer, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Reisig, Wolfgang. Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-69968-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Diaz, Michel, ed. Petri Nets. London, UK: ISTE, 2009. http://dx.doi.org/10.1002/9780470611647.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Guanjun. Petri Nets. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-6309-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Grzegorz, Rozenberg, ed. Petri nets. Amsterdam: North-Holland, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

1950-, Reisig Wolfgang, Rozenberg Grzegorz, and Advanced Course on Petri Nets (1996 : Dagstuhl, Wadern, Germany), eds. Lectures on Petri nets: Advances in Petri nets. Berlin: Springer, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bause, Falko, and Pieter S. Kritzinger. Stochastic Petri Nets. Wiesbaden: Vieweg+Teubner Verlag, 1996. http://dx.doi.org/10.1007/978-3-663-11521-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Jiacun. Timed Petri Nets. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5537-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Reisig, Wolfgang. Understanding Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-33278-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jensen, Kurt. Coloured Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-06289-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Petri nets":

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Moody, John O., and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ş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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cassandras, Christos G., and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Best, Eike, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Petri nets":

1

Jain, Shruti, Pradeep Naik, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Indzhov, Hristo, Dimitar Blagoev, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Letia, Tiberiu S., Elenita M. Durla-Pasca, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Marzougui, Borhen, Khaled Hssine, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

de la Hoz, Jose Daniel Fandiño, Juan Sebastián Sosa, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aman, Bogdan, Gabriel Ciobanu, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Luo, Huaiju, Jiliang Luo, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Comlan, Maurice, David Delfieu, Medesu Sogbohossou, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Petri nets":

1

Prisgrove, L. A., and G. S. Shedler. Symmetric Stochastic Petri Nets. Fort Belvoir, VA: Defense Technical Information Center, March 1985. http://dx.doi.org/10.21236/ada158348.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Clegg, Benjamin Wyatt, David H. Collins, Jr., and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Newcomb, Harry. Modeling Bus Bunching with Petri Nets and Max-Plus Algebra. Portland State University Library, January 2014. http://dx.doi.org/10.15760/honors.66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Suzuki, Ichiro, Jianan Li, and Masafumi Yamashita. Fair Petri Nets and Structural Induction for Rings of Processes. Fort Belvoir, VA: Defense Technical Information Center, December 1994. http://dx.doi.org/10.21236/ada283920.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Shatz, S. Using Petri Nets to Support Concurrent Software Analysis and Design Automation. Fort Belvoir, VA: Defense Technical Information Center, October 1999. http://dx.doi.org/10.21236/ada371497.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

DiLeo, John J. Use of Petri Nets in the Simulation of Command and Control Systems. Fort Belvoir, VA: Defense Technical Information Center, October 1994. http://dx.doi.org/10.21236/ada289942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Jianan, Ichiro Suzuki, and Masafumi Yamashita. Decision Problems Related to Structural Induction for Rings of Petri Nets with Fairness,. Fort Belvoir, VA: Defense Technical Information Center, October 1995. http://dx.doi.org/10.21236/ada297111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Schmerl, Bradley, Jonathan Aldrich, David Garlan, Rick Kazman, and Hong Yan. DiscoTect: A System for Discovering the Architectures of Running Programs using Colored Petri Nets. Fort Belvoir, VA: Defense Technical Information Center, March 2006. http://dx.doi.org/10.21236/ada456147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yablonskyy, Maxym. «NEW DAYS» WEEKLY AND PETRO VOLYNIAK, PUBLISHER AND AUTHOR. Ivan Franko National University of Lviv, February 2021. http://dx.doi.org/10.30970/vjo.2021.49.11058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In the article on the material of the Salzburg weekly «New Days» (1945–1947) various spheres of activity of Peter Volyniak are presented. It is noted that this edition was a business card of the publishing house of the same name and had a history of continuation: in Toronto Petro Volyniak restored the publishing house of the same name and continued the publication in the format of the universal monthly «New Days» (1950–1969). The article also presents periodicals («Latest News», «New Days», «Timpani», «Our Way») and literary, artistic and scientific collection «Steering Wheel», which were published in the Salzburg publishing house of Peter Volyniak «New Days». The purpose of the publication is to trace the path of Petro Volyniak from a writer to a literary critic, journalist and publisher. This trend is reproduced in chronological order. Peter Volyniak as a writer is informed in the article «Literary Evening of P. Volyniak» (author – M. Ch-ka). O. Satsyuk’s literary-critical article is devoted to the coverage of ideological and artistic aspects of Petro Volyniak’s collection «The Earth Calls» (Salzburg, 1947). Petro Volyniak as a literary critic is presented in an article devoted to a collection of literary tales by A. Kolomiyets (Salzburg, 1946), which was published by «New Days». Petro Volyniak as a journalist presents the essay «This is our song…». With the help of content analysis it was observed that the text is divided into two parts: the first contains the author’s reflections on the Ukrainian song, its role in the life of the Ukrainian people; in the second, main, Peter Okopny’s activity abroad is presented. The publisher Petro Volyniak in 1947 in a separate publication of the February issue of the weekly summarizes the third year of activity, providing statistics on the publication of periodicals, books, postcards, calendars, various small format materials. The analyzed material demonstrated the experience of combining creative work and commercial activity.

To the bibliography