Logical Control of Complex Resource Allocation Systems

Scheduling in a stochastic network is an issue in many applications such as the workflow on production shop floors, automated service operations on internet platforms, traffic coordination in guidepath-based transport systems, and resource allocation in multi-core computer architectures. It is an area of the modern scheduling theory with very limited results. To a large extent, the lack of results is due to the intricacies that arise from the blocking and deadlocking effects that take place in these networks which prevent analysis using classical modeling frameworks. These type of scheduling problems can be resolved by breaking them into a supervisory control problem that seeks to prevent the deadlock formation in the underlying resource allocation dynamics, and a scheduling problem formulated on the admissible subspace to be defined by the adopted supervisory control policy.

Logical Control of Complex Resource Allocation Systems provides a comprehensive tutorial on solutions to the supervisory control problem. The reader is shown results that are theoretically rigorous yet offer rich practical applications. These resource allocation techniques have major implications for many modern-day and future applications. They also point the way forward for the necessary further research to successfully solve the scheduling problems in such systems.

Logical Control of Complex Resource Allocation Systems is a comprehensive introduction for students, researchers, and practitioners into a significant development at the core of many control systems.

1126276395
Logical Control of Complex Resource Allocation Systems

Scheduling in a stochastic network is an issue in many applications such as the workflow on production shop floors, automated service operations on internet platforms, traffic coordination in guidepath-based transport systems, and resource allocation in multi-core computer architectures. It is an area of the modern scheduling theory with very limited results. To a large extent, the lack of results is due to the intricacies that arise from the blocking and deadlocking effects that take place in these networks which prevent analysis using classical modeling frameworks. These type of scheduling problems can be resolved by breaking them into a supervisory control problem that seeks to prevent the deadlock formation in the underlying resource allocation dynamics, and a scheduling problem formulated on the admissible subspace to be defined by the adopted supervisory control policy.

Logical Control of Complex Resource Allocation Systems provides a comprehensive tutorial on solutions to the supervisory control problem. The reader is shown results that are theoretically rigorous yet offer rich practical applications. These resource allocation techniques have major implications for many modern-day and future applications. They also point the way forward for the necessary further research to successfully solve the scheduling problems in such systems.

Logical Control of Complex Resource Allocation Systems is a comprehensive introduction for students, researchers, and practitioners into a significant development at the core of many control systems.

99.0 In Stock
Logical Control of Complex Resource Allocation Systems

Logical Control of Complex Resource Allocation Systems

by Spyros Reveliotis
Logical Control of Complex Resource Allocation Systems

Logical Control of Complex Resource Allocation Systems

by Spyros Reveliotis

Paperback

$99.00 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Related collections and offers


Overview

Scheduling in a stochastic network is an issue in many applications such as the workflow on production shop floors, automated service operations on internet platforms, traffic coordination in guidepath-based transport systems, and resource allocation in multi-core computer architectures. It is an area of the modern scheduling theory with very limited results. To a large extent, the lack of results is due to the intricacies that arise from the blocking and deadlocking effects that take place in these networks which prevent analysis using classical modeling frameworks. These type of scheduling problems can be resolved by breaking them into a supervisory control problem that seeks to prevent the deadlock formation in the underlying resource allocation dynamics, and a scheduling problem formulated on the admissible subspace to be defined by the adopted supervisory control policy.

Logical Control of Complex Resource Allocation Systems provides a comprehensive tutorial on solutions to the supervisory control problem. The reader is shown results that are theoretically rigorous yet offer rich practical applications. These resource allocation techniques have major implications for many modern-day and future applications. They also point the way forward for the necessary further research to successfully solve the scheduling problems in such systems.

Logical Control of Complex Resource Allocation Systems is a comprehensive introduction for students, researchers, and practitioners into a significant development at the core of many control systems.


Product Details

ISBN-13: 9781680832501
Publisher: Now Publishers
Publication date: 04/05/2017
Series: Foundations and Trends(r) in Systems and Control , #10
Pages: 240
Product dimensions: 6.14(w) x 9.21(h) x 0.51(d)

Table of Contents

1. Introduction. 2. Sequential Resource Allocation Systems and their Supervisory Control Problem of Deadlock Avoidance. 3. Classes Admitting Maximally Permissive Deadlock Avoidance of Polynomial Complexity. 4. Efficient Implementations of the Maximally Permissive DAP as a Classifier. 5. RAS Logical Analysis and Control through Petri Net Theory. 6. Suboptimal Deadlock Avoidance for the Considered RAS. 7. Some Concluding Remarks. Appendices. References
From the B&N Reads Blog

Customer Reviews