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 published on a yearly basis
Papers
More filters
02 Apr 2001
TL;DR: A state space exploration method for on-the-fly verification aimed at systems for which it is possible to define a measure of progress based on the states of the system, applicable to a wide range of modelling languages.
Abstract: We present a state space exploration method for on-the-fly verification. The method is aimed at systems for which it is possible to define a measure of progress based on the states of the system. The measure of progress makes it possible to delete certain states on-the-fly during state space generation, since these states can never be reached again. This in turn reduces the memory used for state space storage during the task of verification. Examples of progress measures are sequence numbers in communication protocols and time in certain models with time. We illustrate the application of the method on a number of Coloured Petri Net models, and give a first evaluation of its practicality by means of an implementation based on the DESIGN/CPN state space tool. Our experiments show significant reductions in both space and time used during state space exploration. The method is not specific to Coloured Petri Nets but applicable to a wide range of modelling languages.
124 citations
18 Apr 2005
TL;DR: A liveness characterization is introduced, establishing how deadlocks can be studied in terms of circular waits and an iterative method that successively forbids deadlock related states is obtained, synthesizing the control necessary to ensure a final live behavior.
Abstract: A new method for the deadlock prevention problem in concurrent systems where a set of processes share a set of common resources in a conservative way is proposed. It can be applied to flexible manufacturing systems, modeled with Petri nets. In this paper, we present a set of important results related to the deadlock prevention problem in S4PR nets. First, a liveness characterization is introduced, establishing how deadlocks can be studied in terms of circular waits. Second, we show how a circular wait situation corresponds to a particular marking related to a siphon of the Petri net model. Finally, this last characterization is used to obtain an iterative method that successively forbids deadlock related states, synthesizing the control necessary to ensure a final live behavior. The method can be implemented by means of the solutions of a set of integer linear programming problems.
124 citations
01 Mar 1995
TL;DR: This paper presents an introduction to Petri Nets in Flexible and Agile Automation, a Comparative Study of Discrete-Event Control Design for Manufacturing Systems via Ladder Logic Diagrams and Petri nets, and some of the methods used for Specifying Reactive Systems.
Abstract: Preface. 1. Introduction to Petri Nets in Flexible and Agile Automation MengChu Zhou, R. Zurawski. 2. Application of Petri Nets to Sequence Control Programming T. Murata. 3. Computer Aided Design of Logic Controllers with Petri Nets L. Ferrarini. 4. Automatic Generation of Sequence Control Programs via Petri Nets and Logic Tables for Industrial Applications T. Sato, K. Nose. 5. Planning and Scheduling Based on Petri Nets J.-M. Proth, I. Minis. 6. Petri Net-Based Heuristic Scheduling for Flexible Manufacturing Doo Young Lee, F. DiCesare. 7. Scheduling and Rescheduling of AGVs for Flexible and Agile Manufacturing Shifang Li, T. Takamori, S. Tadokoro. 8. Stochastic Petri Net Models of Communication and Flexible Systems Jiacun Wang, Shengbing Jiang. 9. Deadlock Avoidance Policy for Flexible Manufacturing Systems Keyi Xing, Baosheng Hu, Haoxun Chen. 10. Discrete-Event Control Design for Manufacturing Systems via Ladder Logic Diagrams and Petri Nets: a Comparative Study K. Venkatesh, MengChu Zhou, R.J. Caudill. 11. From State Transition Models to DFD Extended Methods for Specifying Reactive Systems Abd-El-Kader Sahraoui. 12. Supervisory Control Specification and Synthesis M. Jafari. Index.
124 citations
Book•
03 Jan 1990
TL;DR: This document discusses the design and implementation of the Maruti Operating System, a real-Time operating system based on the Petri Net model, and the challenges faced in implementing such a system.
Abstract: Part I: Real-Time Issues. Time Handling. Objects. Adding Time to Objects. Part II: Real-Time Applications. Real-Time System Life Cycle. Structured Design Approaches. Petri Net Models. Axiomatic Approaches. Language Support and Restrictions. Verification and Validation of Real-Time Software. Part III: Real-Time Operating Systems. Allocation and Scheduling. Verification of Schedulability. Resource Allocation. Communication. Part IV: Operating System Implementation. The Maruti Operating System. Operational Issues and Examples. Part V: Epilog. 1990 ISE 544pp
124 citations
03 Oct 1995
TL;DR: A memory-efficient structured representation for the class of superposed generalized stochastic Petri nets (GSPNs), which is less restrictive than in previous work, and a new iterative analysis algorithm which is able to solve models which have state spaces with several million states.
Abstract: The numerical analysis of various modeling formalisms profits from a structured representation for the generator matrix Q of the underlying continuous-time Markov chain, where Q is described by a sum of tensor (Kronecker) products of much smaller matrices. In this paper, we describe such a representation for the class of superposed generalized stochastic Petri nets (GSPNs), which is less restrictive than in previous work. Furthermore a new iterative analysis algorithm is proposed. It pays special attention to a memory-efficient representation of iteration vectors as well as to a memory-efficient structured representation of Q in consequence the new algorithm is able to solve models which have state spaces with several million states, where other exact numerical methods become impracticable on a common workstation.
123 citations