scispace - formally typeset
Journal ArticleDOI

Petri nets: Properties, analysis and applications

Tadao Murata
- Vol. 77, Iss: 4, pp 541-580
TLDR
The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Abstract
Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Single-Entry Single-Exit decomposed conformance checking

TL;DR: A novel decomposition technique is presented that partitions larger process models and event logs into smaller parts that can be analyzed independently and helps to speed up conformance checking, but also provides improved diagnostics.
Journal ArticleDOI

Lyapunov stability of a class of discrete event systems

TL;DR: The authors introduce a logical DES model and define stability in the sense of Lyapunov and asymptotic stability for logical DES and provide a general characterization of the stability properties of automata-theoretic DES models, Petri nets, and finite state systems.
Journal ArticleDOI

Petri nets and integrality relaxations: A view of continuous Petri net models

TL;DR: An overview of the emerging field of Petri nets is given, focused on the relationship between the properties of (discrete) PNs and the corresponding properties of their continuous approximation, which may lead to deterministic continuous differential systems with complex behaviors.
Book ChapterDOI

Verification of EPCs: using reduction rules and petri nets

TL;DR: This paper presents a software tool that supports a two-step approach to EPC verification and thus allows for the verification of real-life EPCs as illustrated by two case studies.
Journal ArticleDOI

A formal modeling approach for supply chain event management

TL;DR: This paper proposes Petri nets extended with time and color (to represent case data) as a formalism for managing events and designed seven basic patterns to capture modeling concepts that arise commonly in supply chains.
References
More filters

Kommunikation mit Automaten

C. A. Petri
TL;DR: The theory of automata is shown not capable of representing the actual physical flow of information in the solution of a recursive problem and a theory of communication is proposed that yields a means of representation that with equal rigor and simplicity accomplishes more than the theory of synchronous automata.
Journal ArticleDOI

A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

TL;DR: It is shown that GSPN are equivalent to continuous-time stochastic processes, and solution methods for the derivation of the steady state probability distribution are presented.
Journal ArticleDOI

Performance Analysis Using Stochastic Petri Nets

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.
Journal ArticleDOI

Parallel program schemata

TL;DR: This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing, related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation.
Journal ArticleDOI

Recoverability of Communication Protocols--Implications of a Theoretical Study

TL;DR: The time-Petri net (TPN) appears to be a suitable model for the study of practical recoverable processes and several practical communication protocols are formally designed and analyzed using this new model.