scispace - formally typeset
Search or ask a question
Topic

Petri net

About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: An enumerative method is proposed in order to exhaustively validate the behavior of Merlin's time Petri net model and it is applied to the specification and verification of the alternating bit protocol as a simple illustrative example.
Abstract: A description and analysis of concurrent systems, such as communication systems, whose behavior is dependent on explicit values of time is presented. An enumerative method is proposed in order to exhaustively validate the behavior of P. Merlin's time Petri net model, (1974). This method allows formal verification of time-dependent systems. It is applied to the specification and verification of the alternating bit protocol as a simple illustrative example. >

1,129 citations

Journal ArticleDOI
01 Apr 1995
TL;DR: This paper illustrates a compositional method for modeling the concurrent execution of working processes in flexible manufacturing systems (FMS) through a special class of Petri nets that is built from state machines sharing a set of places modeling the availability of system resources.
Abstract: In this paper we illustrate a compositional method for modeling the concurrent execution of working processes in flexible manufacturing systems (FMS) through a special class of Petri nets that we call S/sup 3/PR. In essence, this class is built from state machines sharing a set of places modeling the availability of system resources. The analysis of S/sup 3/PR leads us to characterize deadlock situations in terms of a zero marking for some structural objects called siphons. In order to prevent the system from deadlocks, we propose a policy for resource allocation based on the addition of new places to the net imposing restrictions that prevent the presence of unmarked siphons (direct cause of deadlocks). Finally we present the application of this technique to a realistic FMS case. >

1,108 citations

Book
01 Jul 2009
TL;DR: This textbook Jensen and Kristensen introduce the constructs of the CPN modelling language and present the related analysis methods in detail and provides a comprehensive road map for the practical use of CPN by showcasing selected industrial case studies that illustrate the practical Use of CPD for design, specification, simulation, verification and implementation in various application domains.
Abstract: Coloured Petri Nets (CPN) is a graphical language for modelling and validating concurrent and distributed systems, and other systems in which concurrency plays a major role. The development of such systems is particularly challenging because of inherent intricacies like possible nondeterminism and the immense number of possible execution sequences. In this textbook Jensen and Kristensen introduce the constructs of the CPN modelling language and present the related analysis methods in detail. They also provide a comprehensive road map for the practical use of CPN by showcasing selected industrial case studies that illustrate the practical use of CPN modelling and validation for design, specification, simulation, verification and implementation in various application domains. Their presentation primarily aims at readers interested in the practical use of CPN. Thus all concepts and constructs are first informally introduced through examples and then followed by formal definitions (which may be skipped). The book is ideally suitable for a one-semester course at an advanced undergraduate or graduate level, and through its strong application examples can also serve for self-study. An accompanying website offers additional material such as slides, exercises and project proposals. Book website:http://www.cs.au.dk/CPnets/cpnbook/

1,104 citations

Journal ArticleDOI
TL;DR: An isomorphism between the behavior of Petri nets with exponentially distributed transition rates and Markov processes is presented and this work solves for the steady state average message delay and throughput on a communication link when the alternating bit protocol is used for error recovery.
Abstract: An isomorphism between the behavior of Petri nets with exponentially distributed transition rates and Markov processes is presented. In particular, k-bounded Petri nets are isomorphic to finite Markov processes and can be solved by standard techniques if k is not too large. As a practical example, we solve for the steady state average message delay and throughput on a communication link when the alternating bit protocol is used for error recovery.

1,090 citations

Journal ArticleDOI
TL;DR: To connect the abstract ideas of events and domains of information, it is shown how casual nets induce certain kinds of domains where the information points are certain sets of events, which allows translations between the languages of net theory and domain theory.

987 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
85% related
Control system
129K papers, 1.5M citations
85% related
Server
79.5K papers, 1.4M citations
85% related
Fuzzy logic
151.2K papers, 2.3M citations
85% related
Robustness (computer science)
94.7K papers, 1.6M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023290
2022662
2021466
2020574
2019651
2018751