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
Book•
01 Jan 2007
TL;DR: This paper presents a method for solving Logical Equations - Calculation of Siphons and Traps andVerification of Detailed System Descriptions to establish the reachability of these graphs.
Abstract: Main Notions, Problems and Methods.- Reduced Reachability Graphs.- Decomposition for Analysis.- Analysis by Solving Logical Equations - Calculation of Siphons and Traps.- Verification of Detailed System Descriptions.- Conclusion.
105 citations
01 Jul 1985
105 citations
11 Aug 2003
TL;DR: The main advantage over other methods is that the observer presented herein is given as an IPN, allowing further analysis of the system-observer pair, and a method for designing asymptotic observers is discussed.
Abstract: This paper is concerned with the analysis of the observability of the discrete event systems (DES) modeled by interpreted Petri nets (IPN). This paper presents three major contributions on the field of the observability of DES. First, an observability definition for IPN is proposed. This definition is more precise than previous ones because it deals with the possibility of determining the system's initial state, using the knowledge of the system's inputs, outputs, and structure. Later, a novel characterization of the IPN exhibiting the observability property that is based on the IPN structure is presented. Finally, a method for designing asymptotic observers is discussed. The main advantage over other methods is that the observer presented herein is given as an IPN, allowing further analysis of the system-observer pair.
105 citations
TL;DR: A three-layer model of a computer network is used to introduce the concept of interface and of end-to-end protocols and models presented here have been successfully used for modeling transport protocols.
Abstract: A three-layer model of a computer network is used to introduce the concept of interface and of end-to-end protocols. Using a simple interface protocol as example, finite state automaton and Petri nets are introduced. The idea of an interface machine is rejected and the problems related to the transmission medium are approached. End-to end protocols request a global model which includes two local models and a transmission medium model. However, the local model has to be generalized. This eventually leads to the association of the state of the automaton with a context. Petri nets have also to be expanded. Models presented here have been successfully used for modeling transport protocols.
105 citations
TL;DR: Ergodicity and throughput bound characterization are addressed for a subclass of timed and stochastic Petri nets, interleaving qualitative and quantitative theories.
Abstract: Ergodicity and throughput bound characterization are addressed for a subclass of timed and stochastic Petri nets, interleaving qualitative and quantitative theories. The nets considered represent an extension of the well-known subclass of marked graphs, defined as having a unique consistent firing count vector, independently of the stochastic interpretation of the net model. In particular, persistent and mono-T-semiflow net subclasses are considered. Upper and lower throughput bounds are computed using linear programming problems defined on the incidence matrix of the underlying net. The bounds proposed depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). From a different perspective, the considered subclasses of synchronized queuing networks; thus, the proposed bounds can be applied to these networks. >
105 citations