Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Reveliotis, Spyros

doi:10.1201/9781420013719.ch10

Cited by 14 publications

(13 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, even in its feasible cases, practical experience has shown that it is very demanding computationally and it results in PN representations of the maximally permissive LES that are much larger than the PN modeling the original RAS. The reader can find an extensive coverage of all these past developments in [33], [29], [25], [21], and the references cited therein.…”

Section: Pervision (Les)mentioning

confidence: 99%

A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems

Nazeem

Reveliotis

2011

IEEE Trans. Automat. Sci. Eng.

Self Cite

View full text Add to dashboard Cite

-Past works towards the effective deployment of the maximally permissive liveness-enforcing supervisor (LES) for sequential resource allocation systems (RAS) have been stalled by (i) the NP-Hardness of the computation of this policy for the majority of the considered RAS classes, and (ii) the inability of the adopted more compact representations of the underlying RAS dynamics to provide an effective representation of the target policy for all RAS instantiations. This paper proposes a novel approach to the aforementioned problem, that can be perceived as a two-stage process: The first stage computes the maximally permissive LES by employing an automaton-based representation of the RAS behavior and techniques borrowed from the Ramadge & Wonham (R&W) Supervisory Control framework. The second stage seeks the development of a more compact representation for the dichotomy into admissible and inadmissible -or" safe" and "unsafe" -sub-spaces of the RAS state space, that is effected by the LES developed in the first stage. This compact representation is obtained by (i) taking advantage of certain properties of the underlying sub-spaces, and (ii) the employment of pertinent data structures. The resulting approach is also "complete", i.e., it will return an effectively implementable LES for any given RAS instantiation. Numerical experimentation demonstrates the efficacy of the approach and establishes its ability to support the deployment of maximally permissive LES for RAS with very large structure and state spaces.Note to Practitioners -The problem of designing and deploying liveness-enforcing supervisors (LES) for sequential resource allocation systems is well-documented and extensively researched in the current literature. Acknowledging the fact that the computation of the maximally permissive LES is an NP-hard problem, most of the present solutions tend to trade off maximal permissiveness for computational tractability and ease of the policy design and implementation. In this work, we demonstrate that the maximally permissive LES can be a viable solution for the resource allocation taking place in many practical applications, by (a) effectively differentiating between the off-line and on-line problem complexity, and (b) controlling the latter through the development of succinct and compact representations of the information that is necessary for the characterization of the maximal permissive LES.

show abstract

Section: Pervision (Les)mentioning

confidence: 99%

A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems

Nazeem

Reveliotis

2011

IEEE Trans. Automat. Sci. Eng.

Self Cite

View full text Add to dashboard Cite

show abstract

“…One could guarantee deadlock-freeness by serializing all threads, which of course defeats the purpose of concurrent programming. Maximal permissiveness is an important reason why we employ SBPI rather than the algebraic methods described in [28], [29].…”

Section: B Challenges and Limitationsmentioning

confidence: 99%

The application of supervisory control to deadlock avoidance in concurrent software

Wang

Kelly

Kudlur

et al. 2008

2008 9th International Workshop on Discrete Event Systems

View full text Add to dashboard Cite

Abstract-Ensuring deadlock-free execution of concurrent programs is a notoriously difficult problem, but an increasingly important one as multicore processors compel performanceconscious software developers to parallelize applications. We propose and validate a novel methodology for dynamically controlling the execution of concurrent software in order to provably avoid deadlocks. The methodology is based on supervisory control of discrete event systems modeled by Petri nets. Specifically, we synthesize feedback controllers for concurrent programs based on the theory of supervision based on place invariants and implement the controllers online to guarantee deadlock avoidance. We describe a full implementation of this methodology and report initial experimental results demonstrating its effectiveness and scalability.

show abstract

“…When a deadlock occurs, it is detected and then the system is put back to a deadlock-free state. Deadlock avoidance 4,11,12,15,48,53,54,56,57,73,106,107,109,[122][123][124][125][126][127][128][129][130][131][132][133][134][135][136]319 is a resources allocation mechanism, behind which an online control policy is used to make a correct decision to proceed among the feasible evolutions. Deadlock prevention 6,49,71,72,75,77,82,91,[95][96][97][98]103,111,[137][138][139][140][141][142]…”

Section: Introductionmentioning

confidence: 99%

Deadlock analysis and control based on Petri nets: A siphon approach review

Hou

Barkaoui

2017

Advances in Mechanical Engineering

View full text Add to dashboard Cite

Deadlocks should be eliminated in highly automated manufacturing systems since their occurrence implies the stoppage of the whole or partial system operation. Over the past decades, Petri nets are increasingly becoming one of the most popular and full-fledged mathematical tools to deal with deadlock problems due to their inherent characteristics. In a Petri net formalism, liveness is an important property of system safeness, which implies the absence of global and local deadlock situations in an automated manufacturing system. The liveness assessment can be performed by verifying the satisfiability of certain predicates on siphons, a well-known structural object in Petri nets. Therefore, siphons have received much attention to analyze and control systems modeled with Petri nets. Particularly, elementary siphon theory plays a key role in the development of structurally simple liveness-enforcing Petri net supervisors, leading to a variety of deadlock control approaches. This survey studies on the state-of-the-art elementary siphon theory of Petri nets including refined concepts of elementary siphons and their extended version, computation methods of siphons and elementary ones, controllability conditions, and their application to deadlock control. As a reference, this work attempts to provide a comprehensive and updated research survey on siphons, elementary siphons, and their applications to the deadlock resolution in Petri nets.

show abstract

Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Cited by 14 publications

References 20 publications

A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems

A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems

The application of supervisory control to deadlock avoidance in concurrent software

Deadlock analysis and control based on Petri nets: A siphon approach review

Contact Info

Product

Resources

About