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

Modeling and Verification for Cross-Department Collaborative Business Processes Using Extended Petri Nets

TL;DR: This paper proposes a formal method to give systematic modeling and verification for the cross-department processes when considering different kinds of coordination patterns among different departments using the WF-net model extended with resource and message factors.
Journal ArticleDOI

Reduction and Synthesis of Live and Bounded Free Choice Petri Nets

TL;DR: Reduction rules are provided that make it possible to reduce all and only live and bounded Free Choice Petri nets to a circuit containing one place and one transition.
Journal ArticleDOI

A Novel Approach for Constraint Transformation in Petri Nets With Uncontrollable Transitions

TL;DR: A linear algebraic characterization of the admissible marking set relative to a Petri net with uncontrollable transitions, subject to a linear constraint is presented.
Journal ArticleDOI

A process algebraic framework for specification and validation of real-time systems

TL;DR: This paper introduces Circus Time, a timed extension of Circus, and presents a new UTP time theory, which is used to give semantics to Circus Time and to validate some of its laws, and provides a framework for validation of timed programs based on FDR, the CSP model-checker.
Journal Article

Determining process model precision and generalization with weighted artificial negative events

TL;DR: In this paper, a Petri net conformance checking method is proposed to measure how well a process model performs in terms of precision and generalization with respect to the actual executions of a process as recorded in an event log.
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.