Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case
From MaRDI portal
Publication:5352870
DOI10.1109/TAC.2011.2179422zbMath1369.68055MaRDI QIDQ5352870
Ahmed Nazeem, Spyros A. Reveliotis
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.2011.2179422
Related Items
On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems, Equivalent transformation of nonlinear constraints to linear constraints in Petri nets, On the enforcement of a class of nonlinear constraints on Petri nets, Polynomial-complexity robust deadlock controllers for a class of automated manufacturing systems with unreliable resources using Petri nets, A survey of siphons in Petri nets, 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, Performance optimization for a class of generalized stochastic Petri nets