Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers

A recent line of work has sought the implementation of the maximally permissive deadlock avoidance policy (DAP) for a broad class of complex resource allocation systems (RAS) as a classifier that gives effective and parsimonious representation to the dichotomy of the underlying behavioral space into the admissible and inadmissible subspaces defined by the target policy. The considered RAS class pertains also to the management of the lock allocation in multi-threaded software. The work presented in this paper complements the past developments in this area by providing (i) succinct conditions regarding the possibility of expressing the aforementioned classifier as a set of linear inequalities in the RAS state variables, and (ii) an efficient customized algorithm for the synthesis of pertinent non-linear classifiers that implement the target DAP with minimum run-time computational overhead, in the case that a linear-classifier-based representation of this policy is not possible.

[1]  Spyros Reveliotis Real-time management of resource allocation systems : a discrete event systems approach , 2004 .

[2]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[3]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[4]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[5]  Stéphane Lafortune,et al.  Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case , 2011, IEEE Transactions on Automatic Control.

[6]  Spyros A. Reveliotis,et al.  Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights , 2013, SIAM J. Control. Optim..

[7]  Olfa Mosbahi,et al.  Design of a Maximally Permissive Liveness- Enforcing Petri Net Supervisor for Flexible Manufacturing Systems , 2011, IEEE Transactions on Automation Science and Engineering.

[8]  Scott A. Mahlke,et al.  Gadara nets: Modeling and analyzing lock allocation for deadlock avoidance in multithreaded software , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[9]  Spyros A. Reveliotis,et al.  On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems , 2010, IEEE Transactions on Automatic Control.

[10]  Spyros A. Reveliotis,et al.  Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory , 2011, 2011 IEEE International Conference on Automation Science and Engineering.

[11]  Roberto Cordone,et al.  Monitor optimization in Petri net control , 2011, 2011 IEEE International Conference on Automation Science and Engineering.

[12]  Yufeng Chen,et al.  Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems , 2011, Autom..

[13]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[14]  MengChu Zhou,et al.  Deadlock control methods in automated manufacturing systems , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[15]  Scott A. Mahlke,et al.  Eliminating Concurrency Bugs with Control Engineering , 2009, Computer.