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.2095612zbMATH Open1368.68058MaRDI QIDQ5347802FDOQ5347802
Ahmed Nazeem, Yin Wang, Spyros Reveliotis, Stéphane Lafortune
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Cited In (22)
- Design of optimal Petri-net controllers for a class of flexible manufacturing systems with key resources
- The fundamental closed-form solution of control-related states ofkth order S3PR system with left-side non-sharing resource places of Petri nets
- Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors
- 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
- Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm
- Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
- On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems
- On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
- A survey of siphons in Petri nets
- Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems
- Optimal control applications and methods literature survey (No. 27)
- Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"
- Optimal Petri net supervisor synthesis for forbidden state problems using marking mask
- Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
- Topological reverse mirroring: a new efficient knowledge-based methodology of reachability analysis for Petri nets
- Configuration of liveness-enforcing initial marking with the minimum resources for resource allocation systems
- Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems
- Robust supervisory control for automated manufacturing systems with unreliable resources by analyzing reachable state space
- Time based deadlock prevention for Petri nets
- On the enforcement of a class of nonlinear constraints on Petri nets
- An enhanced supervisory control strategy for periodicity mutual exclusions in discrete event systems based on Petri nets
This page was built for publication: Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347802)