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
Citations
More filters
Journal ArticleDOI
Max-Plus Control Design for Temporal Constraints Meeting in Timed Event Graphs
TL;DR: The synthesis of a control law that ensures the satisfaction of a single constraint for a single input system is presented and the method is extended to the multi-inputs, multi-constraints problem.
Journal ArticleDOI
The Design of High-Performance Dynamic Asynchronous Pipelines: High-Capacity Style
Montek Singh,Steven M. Nowick +1 more
TL;DR: This paper introduces a high-throughput asynchronous pipeline style, called high-capacity (HC) pipelines, targeted to datapaths that use dynamic logic, with a novel highly-concurrent handshake protocol, with fewer synchronization points between neighboring pipeline stages than almost all existing asynchronous dynamic pipelining approaches.
Journal ArticleDOI
A modelling and analysis tool for discrete events systems: continuous Petri net
Hassane Alla,René David +1 more
TL;DR: The autonomous model is presented as a limit case of autonomous discrete Petri net and thus preserves most of the properties of classical Petri nets, and the approximation given by the continuous model is often satisfactory, especially in the case of large markings.
Posted Content
Artifact Lifecycle Discovery
TL;DR: This article presents a method for automated discovery of artifact-centric process models starting from logs consisting of flat collections of event records so that a wide range of existing (non-artifact-centric) automated process discovery methods can be reused in a flexible manner.
Hierarchical process mining for scalable software analysis
TL;DR: This thesis shows how process mining can be used for analyzing software systems, and addresses the lack of support for hierarchical subprocesses, recursive behavior, and cancelation behavior, which is commonly found in software behavior.
References
More filters
Kommunikation mit Automaten
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
P. Merlin,D. Farber +1 more
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.