In: Desel, J.; Silva, M.: Lecture Notes in Computer Science, Vol. 1420: 19th Int. Conf. on Application and Theory of Petri Nets, ICATPN'98, Lisbon, Portugal, June 1998, pages 64-83. Berlin: Springer-Verlag, June 1998.
Abstract: 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 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.