Real-time management of resource allocation systems. A discrete event systems approach.

DOI10.1007/B104057MaRDI QIDQ1769928zbMATH OpenOpenAlexFDO

Authors Spyros Reveliotis

Publication date 30 March 2005

Published in International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104057

zbMATH Keywords

computational complexityoptimalityrobustnessfeedbackoptimal solutionsNP-hardPetri netscontinuous-time Markov decision processesresource allocation problemsmaximal permissivenessneurodynamic programmingcomputational realizabilitycontrol of discrete event systemsnonblocking behaviour

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Sensitivity (robustness) (93B35) Discrete event control/observation systems (93C65) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02)

Recommendations

• Structural methods for the control of discrete event dynamic systems -- the case of the resource allocation problem
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• A SYSTEM THEORETICAL APPROACH TO RESOURCE ALLOCATION PROBLEMS
• Optimal control for resource allocation in discrete event systems

Cited in

(21)

• Optimal linear separation of the safe and unsafe subspaces of sequential resource allocation systems as a set-covering problem: algorithmic procedures and geometric insights
• Complexity of the deadlock problem for Petri nets modeling resource allocation systems
• Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
• Robustness analysis of Petri nets for assembly/disassembly processes with unreliable resources
• scientific article; zbMATH DE number 1820096 (Why is no real title available?)
• Design of a maximally permissive liveness-enforcing supervisor with reduced complexity for automated manufacturing systems
• Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
• Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait
• Robust control reconfiguration of resource allocation systems with Petri nets and integer programming
• Structural methods for the control of discrete event dynamic systems -- the case of the resource allocation problem
• A SYSTEM THEORETICAL APPROACH TO RESOURCE ALLOCATION PROBLEMS
• Editorial: Deadlock analysis and control in resource allocation systems
• Multi-level control for multiple mobile robot systems
• Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
• An algorithm to compute the minimal siphons in \(S^4 PR\) nets
• scientific article; zbMATH DE number 194602 (Why is no real title available?)
• Supervision based on place invariants: a survey
• A study of a dynamic progressive reasoning system
• Interpretable modelling of retail demand and price elasticity for passenger flights using booking data
• Performance optimization for a class of generalized stochastic Petri nets
• A distributed protocol for motion coordination in free-range vehicular systems

This page was built for publication: Real-time management of resource allocation systems. A discrete event systems approach.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769928)