Lender processes competing for shared resources: Beyond the S4PR paradigm

Formal models, as Petri nets, applied to the resource allocation problem have been a fruitful approach in the last years from a double perspective. Firstly, the consolidation of an abstraction process of systems leading to models structured around the concepts of processes and resources, which can be easily translated into Petri nets. Secondly, the obtention of analysis results characterizing deadlock states, as well as methods to amend the problem. Thanks to abstraction, this methods can be applied to many different application domains, although manufacturing is yet predominant. In this paper we follow the same philosophy, but extending the kind of systems that can be tackled. These extensions allow to consider nested iterations within the processes, and to hold resources in the initial state. We will show that these extensions are very relevant, from the real-world system point of view, in order to extend these techniques to a broader scope of scenarios. Nevertheless, the behaviours of the resulting models are much more complex than those of the previous restricted models, e.g., non-directedness.

[1]  Maria Pia Fanti,et al.  Event-based feedback control for deadlock avoidance in flexible production systems , 1997, IEEE Trans. Robotics Autom..

[2]  MuDer Jeng,et al.  ERCN-merged nets and their analysis using siphons , 1999, IEEE Trans. Robotics Autom..

[3]  Joaquín Ezpeleta,et al.  A Class of Well Structured Petri Nets for Flexible Manufacturing Systems , 1998, ICATPN.

[4]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[5]  Eike Best,et al.  Free choice systems have home states , 2004, Acta Informatica.

[6]  Joaquín Ezpeleta,et al.  A deadlock avoidance approach for nonsequential resource allocation systems , 2002, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[7]  Manuel Silva Suárez,et al.  Liveness and Home States in Equal Conflict Systems , 1993, Application and Theory of Petri Nets.

[8]  Mark Lawley,et al.  Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems , 1997, IEEE Trans. Autom. Control..

[9]  David Harel,et al.  On folk theorems , 1980, CACM.

[10]  Joaquín Ezpeleta,et al.  A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states , 2002, IEEE Trans. Robotics Autom..

[11]  Manuel Silva,et al.  Introducing Petri nets , 1993 .

[12]  Manuel Silva Suárez,et al.  On the Computation of Structural Synchronic Invariants in P/T Nets , 1988, European Workshop on Applications and Theory of Petri Nets.

[13]  Rahul Simha,et al.  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems , 1989, IEEE Trans. Computers.

[14]  Kurt Lautenbach,et al.  Reproducibility of the Empty Marking , 2002, ICATPN.

[15]  Fernando García Vallés Contributions to the structural and symbolic analysis of place/transition nets, with applications to flexible manufacturing systems and asynchronous circuits , 1999 .

[16]  Javier Martínez,et al.  A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[17]  José Manuel Colom,et al.  The Resource Allocation Problem in Flexible Manufacturing Systems , 2003, ICATPN.

[18]  Arie Shoshani,et al.  System Deadlocks , 1971, CSUR.

[19]  Spyros A. Reveliotis,et al.  On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems , 2003, ICATPN.