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 Supervisory Control of Railway Networks Using Petri Nets

TL;DR: This paper provides a modular representation of railway networks in terms of stations and tracks including sensors and semaphores and ensures safeness and local liveness imposing both generalized mutual exclusion constraints and constraints also involving the firing vector.
Journal ArticleDOI

Modeling and analysis of timed Petri nets using heaps of pieces

TL;DR: It is shown that safe timed Petri nets can be represented by special automata over the (max,+) semiring, which compute the height of heaps of pieces, and a heap-based throughput formula is obtained, which is simpler to compute than its traditional timed event graph version.
Journal ArticleDOI

Constructing invariants for hybrid systems

TL;DR: A new method for generating algebraic invariants of hybrid systems using techniques from the theory of ideals over polynomial rings is presented, allowing a trade-off between the complexity of the invariant generation process and the strength of the resulting invariants.
Journal ArticleDOI

Real-life applications of fuzzy logic

TL;DR: This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive and therefore expensive and expensive process of designing and testing armoured personnel carriers.
Journal ArticleDOI

A Formal Approach to Workflow Analysis

TL;DR: It is shown how a mathematical construct called a metagraph can be used to represent workflows, so that such questions can be addressed through formal operations, leading to more effective design of organizational processes.
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.