Operating systems: design and implementation
Operating systems: design and implementation
Behaviour preserving refinements of Petri nets
International Workshop WG '86 on Graph-theoretic concepts in computer science
Some classes of live and safe Petri nets
Concurrency and nets: advances in Petri nets
Introduction to algorithms
Petri nets and flexible manufacturing
Advances in Petri nets 1989
Improving the linearly based characterization of P/T nets
APN 90 Proceedings on Advances in Petri nets 1990
Performance modeling of automated manufacturing systems
Performance modeling of automated manufacturing systems
ACM Computing Surveys (CSUR)
Compositional Synthesis of Live and Bounded Free Choice Petri Nets
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Automatica (Journal of IFAC)
A petri net perspective on the resource allocation problem in software engineering
Transactions on Petri Nets and Other Models of Concurrency V
Comparing Concepts of Object Petri Net Formalisms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
An algorithm to compute the minimal siphons in S4PR nets
Discrete Event Dynamic Systems
A parameterized liveness and ratio-enforcing supervisor for a class of generalized Petri nets
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
This paper is devoted to the synthesis of "well behaved" (live) nets. The work focuses on the synthesis of a subclass of nets that appear in the modeling of a wide set of flexible manufacturing systems (FMS). Basically, these nets are composed of a set of sequential processes that share a set of common resources (with some constraints in their use). Among the set of problems related to FMS, we are going to concentrate on deadlocks. In this paper, we show that for the systems under consideration it is possible to know, from a structural point of view, if a deadlock is reachable. We also show that this knowledge can be obtained in linear time (with respect to the size of the PN model). The result can be used in order to have a quick answer to whether a given configuration is correct or not, to study if such a configuration exists or not and to conclude if some deadlock control policy is needed.