Petri net

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

Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets

Abstract: Some analysis techniques for real-time asynchronous concurrent systems are presented. In order to model clearly the synchronization involved in these systems, an extended timed Petri net model is used. The system to be studied is first modeled by a Petri net. Based on the Petri net model, a system is classified into either: 1) a consistent system; or 2) an inconsistent system. Most real-world systems fall into the first class which is further subclassified into i) decision-free systems; ii) safe persistent systems; and iii) general systems. Procedures for predicting and verifying the system performance of all three types are presented. It is found that the computational complexity involved increases in the same order as they are listed above.

Continuous and hybrid Petri nets

Abstract: Petri nets are widely used to model discrete event dynamic systems (computer systems, manufacturing systems, communication systems…). When a PN contains a large number of tokens, the number of reachable states explodes. This is a practical limitation to the use of Petri nets. Continuous models may provide very good approximations for discrete event systems: this is the basic idea leading to the definition of continuous Petri nets. A continuous PN is a model in which the marking of each place is a real number. In a timed continuous PN, a firing speed is associated with each transition (this basic model is unique although the firing speed may be defined in several ways). Various timed continuous PN models have been defined and they correspond to a specific calculation of the firing speeds. They provide good approximations for performance evaluation when a PN contains a large number of tokens. Modeling a number of parts in a buffer by a real number may generally be an acceptable approximation. However, the s...

Petri Nets and Grafcet: Tools for Modelling Discrete Event Systems

Abstract: Provides a tutorial on Grafcet and Petri Nets and how they are linked. The concepts are introduced with the aid of examples that progressively become more difficult. Grafcet, which became an international standard in 1987, is a French tool inspired by Petri Nets to specify logic control.

General decidability theorems for infinite-state systems

Abstract: Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems), which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a well-ordered and well-founded preorder such that the transition relation is "monotonic" (is a simulation) with respect to the preorder. We show that the following properties are decidable for well-structured systems: reachability; eventuality; and simulation. We also describe how these general principles subsume several decidability results from the literature about timed automata, relational automata, Petri nets, and lossy channel systems.