Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
From MaRDI portal
Publication:540197
DOI10.1016/j.automatica.2011.01.070zbMath1233.93004MaRDI QIDQ540197
Publication date: 1 June 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.01.070
90B30: Production models
93B51: Design techniques (robust design, computer-aided design, etc.)
93A13: Hierarchical systems
93C65: Discrete event control/observation systems
Related Items
Design of Optimal Petri Net Supervisors for Flexible Manufacturing Systems via Weighted Inhibitor Arcs, A deadlock control algorithm using control transitions for flexible manufacturing systems modelling with Petri nets, Maximally Permissive Petri Net Supervisors for Flexible Manufacturing Systems with Uncontrollable and Unobservable Transitions, Extended Elementary Siphons and Their Application to Liveness‐Enforcement of Generalized <scp>P</scp>etri Nets, Necessary and sufficient liveness condition of GS3PR Petri nets, On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems, Petri net controllers for generalized mutual exclusion constraints with floor operators, On structural minimality of optimal supervisors for flexible manufacturing systems, Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems, Synthesis of Petri net supervisors for FMS via redundant constraint elimination, Equivalent transformation of nonlinear constraints to linear constraints in Petri nets, On the enforcement of a class of nonlinear constraints on Petri nets, Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors, Robust deadlock control of automated manufacturing systems with multiple unreliable resources, Resource failure and buffer space allocation control for automated manufacturing systems, Editorial: Deadlock analysis and control in resource allocation systems, A novel method for deadlock prevention of AMS by using resource-oriented Petri nets, Complexity of the deadlock problem for Petri nets modeling resource allocation systems, A survey of siphons in Petri nets, Design of optimal Petri-net controllers for a class of flexible manufacturing systems with key resources, Think-globally-act-locally approach with weighted arcs to the synthesis of a liveness-enforcing supervisor for generalized Petri nets modeling FMSs, Sequential composition of linear systems' clans, Deadlock recovery for flexible manufacturing systems modeled with Petri nets, Petri net representation and reachability analysis of 0--1 integer linear programming problems, One novel and optimal deadlock recovery policy for flexible manufacturing systems using iterative control transitions strategy, A multistep look-ahead deadlock avoidance policy for automated manufacturing systems, Confusion analysis and detection for workflow nets, A branch and bound approach for the design of decentralized supervisors in Petri net models, Robustness of deadlock control for a class of Petri nets with unreliable resources, Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets, Design of control laws for timed event graphs networks subject to mutual exclusion constraints in min-plus algebra, Solving the Problem of Forbidden States in Discrete Event Systems: A Novel Systematic Method for Reducing the Number of Control Places, Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller, Deadlock Control for a Class of Generalized Petri Nets Based on Proper Resource Allocation, Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems, Structure of weakly 2-dependent siphons, Controller Synthesis with Highly Simplified Linear Constraints
Cites Work
