Abstract
In recent times, Petri nets have consolidated as a powerful formalism for the analysis and treatment of deadlocks in Resource Allocation Systems (RAS). In particular, the methodological framework yielded by the S4PR class has raised considerable interest on the grounds of a well-balanced compromise between modelling flexibility and the provision of sound and effective correction techniques. These are strengthened by the advantages of the abstraction process, which allows the effective application of these techniques to diverse application domains. Most of the works on this class focus on providing tools and algorithms for dealing with the so-called resource allocation problem. This paper takes a different approach to provide an insight into the inherent computational complexity of the problem, from the perspective of optimality in either prevention, avoidance or detection of deadlocks. In particular, we will prove that most of the problems involved fall within the category of NP or co-NP-complete problems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Coffman, E.G., Elphick, M., Shoshani, A.: System deadlocks. ACM Computing Surveys 3(2), 67–78 (1971)
Gold, E.M.: Deadlock prediction: Easy and difficult cases. SIAM Journal on Computing 7(3), 320–336 (1978)
Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)
Lautenbach, K., Thiagarajan, P.S.: Analysis of a resource allocation problem using Petri nets. In: Syre, J.C. (ed.) Proc. of 1st European Conf. on Parallel and Distributed Processing, Toulouse, Cepadues Editions, pp. 260–266 (1979)
Ezpeleta, J., Colom, J., Martínez, J.: A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Trans. on Robotics and Automation 11(2), 173–184 (1995)
Xie, X., Jeng, M.D.: ERCN-merged nets and their analysis using siphons. IEEE Trans. on Robotics and Automation 29(4), 692–703 (1999)
Park, J., Reveliotis, S.A.: Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings. IEEE Trans. on Automatic Control 46(10), 1572–1583 (2001)
Tricas, F.: Deadlock analysis, prevention and avoidance in sequential resource allocation systems. PhD thesis, University of Zaragoza, Zaragoza (2003)
Lawley, M., Reveliotis, S.: Deadlock avoidance for sequential Resource Allocation Systems: Hard and easy cases. Int. Journal of Flexible Manufacturing Systems 13, 385–404 (2001)
Sulistyono, W., Lawley, M.: Deadlock avoidance for manufacturing systems with partially ordered process plans. IEEE Trans. on Robotics and Automation 17(6), 819–832 (2001)
Brade, R., Zhang, L., Berson, S., Herzog, S., Jamin, S.: RFC 2205: Resource ReSerVation Protocol – Version 1 Functional Specification (1997)
Villapol, M.E., Billington, J.: Analysing properties of the resource reservation protocol. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 377–396. Springer, Heidelberg (2003)
Tricas, F., García-Vallés, F., Colom, J., Ezpeleta, J.: A Petri net structure-based deadlock prevention solution for sequential resource allocation systems. In: Proc. of IEEE Int. Conf. on Robotics and Automation, Barcelona, Spain, pp. 272–278 (2005)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Teruel, E., Silva, M.: Liveness and home states in equal conflict systems. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 415–432. Springer, Heidelberg (1993)
López-Grao, J.P., Colom, J.M.: Lender processes competing for shared resources: Beyond the S4PR paradigm. In: Proc. of IEEE Int. Conf. on Systems, Man and Cybernetics, Taipei, Taiwan (to appear, 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
López-Grao, JP., Colom, JM. (2006). Resource Allocation Systems: Some Complexity Results on the S4PR Class. In: Najm, E., Pradat-Peyre, JF., Donzeau-Gouge, V.V. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2006. FORTE 2006. Lecture Notes in Computer Science, vol 4229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11888116_24
Download citation
DOI: https://doi.org/10.1007/11888116_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46219-4
Online ISBN: 978-3-540-46220-0
eBook Packages: Computer ScienceComputer Science (R0)