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

DOI10.1007/b104057zbMath1069.93002OpenAlexW4247253018MaRDI QIDQ1769928

Spyros A. 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 complexityrobustnessfeedbackoptimalityPetri netsoptimal solutionsNP-hardcontinuous-time Markov decision processesresource allocation problemsmaximal permissivenessneurodynamic programmingcomputational realizabilitycontrol of discrete event systemsnonblocking behaviour

Mathematics Subject Classification ID

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

Related Items (14)

Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory ⋮ Robustness analysis of Petri nets for assembly/disassembly processes with unreliable resources ⋮ Supervision based on place invariants: a survey ⋮ Concurrency bugs in multithreaded software: modeling and analysis using Petri nets ⋮ An algorithm to compute the minimal siphons in \(S^4 PR\) nets ⋮ Multi-level control for multiple mobile robot systems ⋮ Robust control reconfiguration of resource allocation systems with Petri nets and integer programming ⋮ A distributed protocol for motion coordination in free-range vehicular systems ⋮ Design of a Maximally Permissive Liveness-enforcing Supervisor with Reduced Complexity for Automated Manufacturing Systems ⋮ Editorial: Deadlock analysis and control in resource allocation systems ⋮ Complexity of the deadlock problem for Petri nets modeling resource allocation systems ⋮ Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait ⋮ Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks ⋮ Performance optimization for a class of generalized stochastic Petri nets

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