Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case
From MaRDI portal
Publication:5347802
DOI10.1109/TAC.2010.2095612zbMath1368.68058MaRDI QIDQ5347802
Ahmed Nazeem, Yin Wang, Stéphane Lafortune, Spyros A. Reveliotis
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Related Items
Topological reverse mirroring: a new efficient knowledge-based methodology of reachability analysis for Petri nets, Concurrency bugs in multithreaded software: modeling and analysis using Petri nets, An enhanced supervisory control strategy for periodicity mutual exclusions in discrete event systems based on Petri nets, Optimal Petri net supervisor synthesis for forbidden state problems using marking mask, On the enforcement of a class of nonlinear constraints on Petri nets, A survey of siphons in Petri nets, Design of optimal Petri-net controllers for a class of flexible manufacturing systems with key resources, Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm, The fundamental closed-form solution of control-related states ofkth order S3PR system with left-side non-sharing resource places of Petri nets, Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems, Time based deadlock prevention for Petri nets, Optimal control applications and methods literature survey (No. 27), A branch and bound approach for the design of decentralized supervisors in Petri net models, Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks, On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems
