A method for stepwise refinement and abstraction of Petri nets
Ichiro Suzuki,Tadao Murata +1 more
Reads0
Chats0
TLDR
Conditions under which a subnet can be substituted for a single transition while preserving properties such as liveness and boundedness are presented.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1983-08-01 and is currently open access. It has received 309 citations till now. The article focuses on the topics: Petri net & Process architecture.read more
Citations
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: 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.
Journal ArticleDOI
Deadlock analysis of Petri nets using siphons and mathematical programming
Feng Chu,Xiaolan Xie +1 more
TL;DR: This paper exploits the potential of siphons for the analysis of Petri nets and shows that an asymmetric choice net is live iff it is potential-deadlock-free and an augmented marked graph is live and reversible iff the siphon is not a potential deadlock.
Journal ArticleDOI
A Survey of Petri Net Methods for Controlled Discrete EventSystems
TL;DR: An overview of the various models and problems formulated in the literature focusing on two particular models, the controlled Petri nets and the labeled nets, and two efficient techniques for the on-line computation of the control law.
Journal ArticleDOI
A hybrid methodology for synthesis of Petri net models for manufacturing systems
TL;DR: Petri nets are synthesized by first refining operation places through basic design modules in top-down modular ways, then adding nonshared resource places stepwise, and finally adding shared resources places step by step in a bottom-up manner.
Journal ArticleDOI
Parallel and sequential mutual exclusions for petri net modeling of manufacturing systems with shared resources
MengChu Zhou,Frank DiCesare +1 more
TL;DR: A theoretical basis for Petri net synthesis methods is provided that can be used to model systems with shared resources, and to make the resulting nets bounded, live, and reversible.
References
More filters
Journal ArticleDOI
An Algorithm for the General Petri Net Reachability Problem
TL;DR: An algorithm is presented for the general Petri net reachability problem, based on a generalization of the basic reachability tree construction which is made symmetric with respect to the initial and final marking.
Journal ArticleDOI
Analysis of petri nets by stepwise refinements
TL;DR: If the firing of a Transition in a Petri net is considered non instantaneous, it becomes possible to replace a transition in a net B by another net 8’, which allows the description and the analysis of a control structure by stepwise refinements.
Book
Decidability questions for Petri nets
TL;DR: A number of Petri Net problems are shown to be recursively equivalent to the Reachability Problem for Vector Addition Systems, and the equality of Reachability Sets and the equivalence of two Petri Nets in terms of their language-generating capability are recursive undecidable.
Proceedings ArticleDOI
An algorithm for the general Petri net reachability problem
TL;DR: An algorithm is presented for the general Petri net reachability problem based on a generalization of the basic reachability construction which is symmetric with respect to the initial and final marking.
Journal ArticleDOI
Special Feature: Putting Petri Nets to Work
TL;DR: Today's modeling tools, appropriate for conventional sequential systems, will be inadequate for the complex concurrent systems of the 80's, and petri nets may offer a solution.