Petri net

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

Queueing Petri Nets-A formalism for the combined qualitative and quantitative analysis of systems

Abstract: System analysis is often needed with respect to both qualitative and quantitative aspects. In recent decades, several formalisms have been developed that attempt to combine these aspects in one description. Present emphasis is on stochastic Petri nets. One disadvantage of these formalisms is the difficulties when describing scheduling strategies with Petri net elements. A new version of queuing Petri nets (QPNs), which combines queuing networks and Petri nets, aiming at eliminating these disadvantages is described. The new version also exhibits the modeling of timed transitions and timeless queues for describing pure scheduling mechanisms. QPNs are a superset of queueing networks and (generalized stochastic) Petri nets. The analysis of QPNs is discussed, and it is shown that efficient analysis techniques from Petri net theory can be exploited for analysis of QPNs, thus supporting the general objective of combining Petri net and queueing network formalisms. >

Introducation to stochastic Petri nets

Abstract: Stochastic Petri Nets are a modelling formalism that can be conveniently used for the analysis of complex models of Discrete Event Dynami Systems (DEDS) and for their performance and reliability evaluation. The automatic construction of the probabilistic models that underly the dynamic behaviours of these nets rely on a set of results that derive from the theory of untimed Petri nets. The paper introduces the basic motivations for modelling DEDS and briefly overviews the basic results of net theory that are useful for the definition of Stochastic Petri Nets and Generalized Stochastic Petri Nets. The different approaches that have been used for introducing the concept of time in these models are discussed in order to provide the basis for the definition of SPNs and GSPNs as well. Details on the solution techniques and on their computational aspects are provided. A brief overview of more advanced material is included at the end of the paper to highlight the state of the art in this field and to give pointers to relevant results published in the literature.

ProM 4.0: comprehensive support for real process analysis

Abstract: This tool paper describes the functionality of ProM. Version 4.0 of ProM has been released at the end of 2006 and this version reflects recent achievements in process mining. Process mining techniques attempt to extract non-trivial and useful information from so-called "event logs". One element of process mining is control-flow discovery, i.e., automatically constructing a process model (e.g., a Petri net) describing the causal dependencies between activities. Control-flow discovery is an interesting and practically relevant challenge for Petri-net researchers and ProM provides an excellent platform for this. For example, the theory of regions, genetic algorithms, free-choice-net properties, etc. can be exploited to derive Petri nets based on example behavior. However, as we will show in this paper, the functionality of ProM 4.0 is not limited to control-flow discovery. ProM 4.0 also allows for the discovery of other perspectives (e.g., data and resources) and supports related techniques such as conformance checking, model extension, model transformation, verification, etc. This makes ProM a versatile tool for process analysis which is not restricted to model analysis but also includes log-based analysis.

An Introduction to Event Structures

Abstract: Event structures are models of processes as events constrained by relations of consistency and enabling. These notes are intended to introduce the mathematical theory of event structures, show how they are related to Petri nets and Scott domains, and how they can be used to provide semantics to programming languages for parallel processes as well as languages with higher types.

Applications and Theory of Petri Nets 2003

Abstract: This talk presents my personal view of the current status of highlevel Petri Nets, in particular Coloured Petri Nets. What have we achieved over the last 25 years and what are the main challenges that need to be addressed in order to make high-level Petri nets more useful, e.g., to the software industry? What kind of language extensions and tool support do we need to make Petri net modelling, simulation and analysis accessible to the knowledgeable engineer? I will also briefly discuss the main areas which I believe are the most obvious candidates for further theoretical development.