Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms

DOI10.1109/TAC.2013.2266952zbMath1369.68050OpenAlexW2001822592WikidataQ114985632 ScholiaQ114985632MaRDI QIDQ5353394

Roberto Cordone, Ahmed Nazeem, Spyros A. Reveliotis, Luigi Piroddi

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2013.2266952

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Discrete location and assignment (90B80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (4)

Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets ⋮ Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm ⋮ A branch and bound approach for the design of decentralized supervisors in Petri net models ⋮ Performance optimization for a class of generalized stochastic Petri nets

This page was built for publication: Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms