Most of the past research on problem deadlock avoidance for complex resource allocation systems (RAS) has acknowledged fact that computation maximally permissive policy (DAP) possesses super-polynomial complexity most RAS classes, and therefore, it resorted to solutions trade off maximal permissiveness computational tractability. In this paper, we distinguish between off-line on-line is required effective implementation DAP, seek develop representations will require minimal computation. The...

In a recent work of ours (A. Nazeem , "Designing compact and maximally permissive deadlock avoidance policies for complex resource allocation systems through classification theory: The linear case," IEEE Trans. Autom. Control, vol. 56, 2011), we have proposed the reformulation synthesis policy certain classes (RAS) as design classifier effecting dichotomy underlying reachable state space into its safe unsafe subspaces. this work, extend results A. case that sought cannot be represented by...

A recent line of work has sought the implementation maximally permissive deadlock avoidance policy (DAP) for a broad class complex resource allocation systems (RAS) as classifier that gives effective and parsimonious representation to dichotomy underlying behavioral space into admissible inadmissible subspaces defined by policy. The presented in this paper complements past developments area providing 1) succinct conditions regarding possibility expressing aforementioned set linear...

Past works towards the effective deployment of maximally permissive liveness-enforcing supervisor (LES) for sequential resource allocation systems (RAS) have been stalled by (i) NP-Hardness computation this policy majority considered RAS classes, and (ii) inability adopted more compact representations underlying dynamics to provide an representation target all instantiations.This paper proposes a novel approach aforementioned problem, that can be perceived as two-stage process: The first...

Most of the past research on problem deadlock avoidance for sequential resource allocation systems (RAS) has acknowledged fact that maximally permissive policy (DAP) possesses super-polynomial complexity most RAS classes, and it resorted to solutions trade off maximal permissiveness computational tractability. In this work, we seek effective implementation DAP RAS, by distinguishing between off-line on-line computation required specification policy, developing a representation derived result...

An earlier work of ours has proposed a novel approach for the deployment maximally permissive deadlock avoidance policy complex resource allocation systems (RAS), that is based on identification and efficient storage critical subset states underlying RAS state space; availability this information enables an expedient one-step-lookahead scheme blockage transitions will take system behavior outside its safe region. This paper complements aforementioned results by introducing algorithm provides...

A recent line of work has sought the implementation maximally permissive deadlock avoidance policy (DAP) for a broad class complex resource allocation systems (RAS) as classifier that gives effective and parsimonious representation to dichotomy underlying behavioral space into admissible inadmissible subspaces defined by target policy. The considered RAS pertains also management lock in multi-threaded software. presented this paper complements past developments area providing (i) succinct...

A recent line of work has posed the design maximally permissive deadlock avoidance policy for a particular class sequential resource allocation systems as linear classification problem. It also identified connection between classifier problem addressed by it and classical set-covering that been studied in operations research computer science. This paper seeks to explore formalize further this connection, an effort (i) develop novel insights regarding geometric combinatorial structure...

The problem of designing and deploying liveness-enforcing supervisors (LES) for sequential resource allocation systems is well-documented extensively researched in the current literature. Acknowledging fact that computation maximally permissive LES an NP-hard problem, most present solutions tend to trade off maximal permissiveness computational tractability ease policy design implementation. In this work, we demonstrate can be a viable solution taking place many practical applications, by...

Service composition has received significant attention in the research community, and focus been on service semantics algorithms. Surprisingly, problem of representation outcome largely ignored. Ad-hoc workflows are often employed, which typically sacrifice alternative paths parallelism for sake simple representation. In this paper, we show how theory regions, was originally developed to derive Petri nets from finite state automata, can be applied find optimal composition. To apply theory,...

In a recent work of ours, we proposed novel approach for the deployment maximally permissive deadlock avoidance policy (DAP) complex resource allocation systems, that is based on identification and efficient storage critical subset states underlying RAS state space; availability this information enables an expedient one-step-lookahead scheme blockage transitions will take system behavior outside its safe region. This paper complements aforementioned results by introducing algorithm provides...

Multicore architectures in computer hardware bring an unprecedented need for parallel programming. In the work considered this presentation, we are especially interested multithreaded programs with shared data. widelyused programming paradigm, "lock" primitives employed to control access data within program threads. For example, mutual exclusion locks (mutexes) used protect from concurrent inconsistent updates. However, improper use of mutexes can lead familiar "deadly embrace" problem,...

The problem of maximally permissive deadlock avoidance for sequential resource allocation systems (RAS) is a well-defined in the current controls literature. corresponding supervisor known as policy (DAP), and it can be perceived classifier effecting dichotomy underlying state space into its "safe" "unsafe" subspaces. In deployment DAP, an important issue selection effective computationally efficient representation aforementioned dichotomy. A popular such "linear classifier," where...