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

Model-Based Adaptation of Behavioral Mismatching Components

TL;DR: This article presents an approach for software adaptation which relies on an abstract notation based on synchronous vectors and transition systems for governing adaptation rules, and is supported by dedicated algorithms that generate automatically adaptor protocols.
Journal ArticleDOI

Analysis and simulation of Web services

TL;DR: This work defines the semantics for a relevant subset of DAML-S in terms of a first-order logical language and provides decision procedures for Web service simulation, verification and composition.
Journal ArticleDOI

An extended event graph with negative places and tokens for time window constraints

TL;DR: It is proved that the minimum cycle time is the same as the maximum circuit ratio of the circuits with positive token counts and that when there exists circuits with negative token counts, the maximum cycletime is bounded and the minimum circuit ratio is bounded.
Journal Article

Process rewrite systems

TL;DR: The most general and most expressive class of systems in this hierarchy is called process rewrite systems (PRS), which subsume Petri nets, PA-processes, and pushdown processes and are strictly more expressive than any of these.
Journal ArticleDOI

Automatic Battery Replacement System for UAVs: Analysis and Design

TL;DR: A model to evaluate the coverage of a given UAS and a ground station capable of swapping a UAV’s batteries are proposed, followed by a discussion of prototype components and tests of some of the prototype modules.
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.