Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights

@article{Reveliotis2013OptimalLS,
  title={Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights},
  author={Spyros A. Reveliotis and Ahmed Nazeem},
  journal={SIAM J. Control. Optim.},
  year={2013},
  volume={51},
  pages={1707-1726}
}
A recent line of work has posed the design of the maximally permissive deadlock avoidance policy for a particular class of sequential resource allocation systems as a linear classification problem. It has also identified a connection between the classifier design problem addressed by it and the classical set-covering problem that has been studied in operations research and computer science. This paper seeks to explore and formalize further this connection, in an effort to (i) develop novel… 

Figures and Tables from this paper

Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
TLDR
The work presented in this paper provides succinct conditions regarding the possibility of expressing the aforementioned classifier as a set of linear inequalities in the RAS state variables, and an efficient customized algorithm for the synthesis of pertinent nonlinear classifiers that implement the target DAP with minimum run-time computational overhead.
Designing parsimonious representations of the maximally permissive deadlock avoidance policy for complex resource allocation systems through classification theory
TLDR
This work distinguishes between the off-line and the on-line computation that is required for the effective implementation of the maximally permissive DAP, and it seeks to develop representations of this policy that will require minimal on- line computation.
Maximal Linear Deadlock Avoidance Policies for Complex Resource Allocation Systems
TLDR
This paper provides a methodology for synthesizing linear DAPs for any given RAS instance that might not be maximally permissive in the original sense of this term, but observe a more relaxed notion of “maximality”.
Maximally Permissive Supervisor Synthesis Using Reachability and Structural Analysis of Petri Nets
  • Hefeng Chen, N. Wu, Zhiwu Li
  • Business
    2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC)
  • 2019
TLDR
This paper addresses the deadlock prevention problem by developing efficient methods to reduce the computational overhead through the establishment of algebraic conditions to verify the maximal permissiveness of linear constraints imposed on the studied systems.
On the Linear Separability of the Safe and Unsafe State Subsets of Single-Unit Resource Allocation Systems
  • S. Reveliotis
  • Mathematics
    IEEE Transactions on Automatic Control
  • 2014
The main purpose of this correspondence is to demonstrate, through a counter-example, that, contrary to what was published recently in [1], the states belonging to the safe and unsafe subspaces of a
Deadlock Avoidance Policies for Automated Manufacturing Systems Using Finite State Automata
TLDR
The last part of the chapter discusses some approaches that have been developed by the relevant research community in its effort to deal with the negative complexity result of deadlock avoidance in flexibly automated manufacturing systems.
On Invariant-Based Monitors That Enforce Liveness in a Class of Partially Controlled General Petri Nets
TLDR
This work considers a class of Petri Net structures where the existence of a liveness enforcing supervisory policy (LESP) for an initial marking implies there is a LESP for a larger initial marking, and considers invariant-based monitors for liveness enforcement in an instance of this class.
...
...

References

SHOWING 1-10 OF 25 REFERENCES
Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
TLDR
The work presented in this paper provides succinct conditions regarding the possibility of expressing the aforementioned classifier as a set of linear inequalities in the RAS state variables, and an efficient customized algorithm for the synthesis of pertinent nonlinear classifiers that implement the target DAP with minimum run-time computational overhead.
Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory
TLDR
The reported results establish that the proposed method can support the effective deployment of maximally permissive DAP for RAS with very large state spaces, and develops a representation of the derived result that will require minimal on-line computation.
A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems
TLDR
A novel approach to the effective deployment of the maximally permissive liveness-enforcing supervisor (LES) for sequential resource allocation systems (RAS) that can be perceived as a two-stage process and which will return an effectively implementable LES for any given RAS instantiation.
On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
TLDR
This technical note derives an alternative proof for the NP-hardness of maximally permissive liveness-enforcing supervision in Linear, Single-Unit Resource Allocation Systems, that is more concise and more lucid than the currently existing proof.
Deadlock Prediction: Easy and Difficult Cases
The subject of this paper is the computational complexity of the deadlock prediction problem for resource allocation. This problem is the question “Is deadlock avoidable?” i.e. “Is there a feasible
A Survey and Comparison of Petri Net-Based Deadlock Prevention Policies for Flexible Manufacturing Systems
  • Zhiwu Li, Mengchu Zhou, N. Wu
  • Business
    IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
  • 2008
TLDR
This paper intends to review and compare a variety of Petri net-based deadlock prevention policies reported in the literature in terms of structural complexity, behavior permissiveness, and computational complexity to facilitate engineers in choosing a suited method for their industrial application cases.
A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states
TLDR
The paper presents an extension of the classical Banker's algorithm to a class of flexible manufacturing systems modeled by means of Petri nets, which have two interesting characteristics from the application point of view.
Deadlock Resolution in Computer-Integrated Systems
TLDR
List of CONTRIBUTors PREFACE INTRODUCTION to DEADLOCK RESEARCH in COMPUTER-INTEGRATED SYSTEMS M.P. Fanti and M.C. Zhou DEADLOCK AVOIDANCE and DYNAMIC ROUTing FLEXIBILITY in AUTOMATED MANUFACTURING SYSTEMS, and the EFFECT of MODELING and CONTROL TECHNIQUES on the MANAGEMENT of DEADLOCKS in FMS.
Monitor optimization in Petri net control
  • R. Cordone, L. Piroddi
  • Computer Science
    2011 IEEE International Conference on Automation Science and Engineering
  • 2011
TLDR
This paper proposes an optimization approach aiming at the direct design of the monitors, that allows for an easy formalization of the various control objectives and yields significant improvements over known benchmark problems.
...
...