A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems

No abstract is available for this paper.

• Publication year

  2011

• Venue

  IEEE Transactions on Automation Science and Engineering

• Publication date

  2011-06-23

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/TASE.2011.2159112
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Model Checking

  2018cited by this paper
• Data-Structures

  2017cited by this paper
• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems

  2011influential reference
• SUPERVISORY CONTROL OF DISCRETE EVENT SYSTEMS

  2011cited by this paper
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case

  2011cited by this paper
• Design of a Maximally Permissive Liveness- Enforcing Petri Net Supervisor for Flexible Manufacturing Systems

  2011influential reference
• Model checking

  2009cited by this paper
• A Survey and Comparison of Petri Net-Based Deadlock Prevention Policies for Flexible Manufacturing Systems

  2008cited by this paper
• Facility Logistics: Approaches and Solutions to Next Generation Challenges

  2007cited by this paper
• Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

  2007cited by this paper
• Real-time management of resource allocation systems : a discrete event systems approach

  2004cited by this paper
• Deadlock Resolution in Computer-Integrated Systems

  2004cited by this paper
• STCT: An Efficient Algorithm for Supervisory Control Design

  2002cited by this paper
• A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states

  2002cited by this paper
• Cooperating sequential processes

  2002cited by this paper
• Data Decision Diagrams for Petri Net Analysis

  2002cited by this paper
• Deadlock Avoidance for Sequential Resource Allocation Systems: Hard and Easy Cases

  2001cited by this paper
• Conflict resolution in AGV systems

  2000cited by this paper
• Introduction to Discrete Event Systems

  1999cited by this paper
• A correct and scalable deadlock avoidance policy for flexible manufacturing systems

  1998cited by this paper
• Theory of Regions

  1996influential reference
• Structural analysis and control of flexible manufacturing systems with a performance perspective

  1996cited by this paper
• Deadlock avoidance policies for automated manufacturing cells

  1995cited by this paper
• Control of Discrete Event Systems

  1992cited by this paper
• Generalized mutual exclusion contraints on nets with uncontrollable transitions

  1992cited by this paper
• Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows

  1990cited by this paper
• Petri nets: Properties, analysis and applications

  1989cited by this paper
• Deadlock Prediction: Easy and Difficult Cases

  1978cited by this paper
• Complexity of trie index construction

  1976cited by this paper
• System Deadlocks

  1971cited by this paper
• Some deadlock properties of computer systems

  1971cited by this paper
• Prevention of system deadlocks

  1969cited by this paper
• Avoiding Deadlock in Multitasking Systems

  1968cited by this paper

• A Refined Siphon-Based Deadlock Prevention Policy for a Class of Petri Nets

  2023cites this paper
• On Hierarchical Construction of the State Space of an Automated Manufacturing System Modeled With Petri Nets

  2020cites this paper
• On a maximally permissive deadlock prevention policy for automated manufacturing systems by using resource-oriented Petri nets.

  2019cites this paper
• State Space Characterization of Disjunctive Single-Unit Resource Allocation Systems

  2018cites this paper
• Maximal Linear Deadlock Avoidance Policies for Complex Resource Allocation Systems

  2018cites this paper
• Robust Deadlock Avoidance for Sequential Resource Allocation Systems With Resource Outages

  2017cites this paper
• Logical Control of Complex Resource Allocation Systems

  2017cites this paper
• Advanced control in factory automation: a survey

  2017cites this paper
• Real-time management of complex resource allocation systems: Necessity, achievements and further challenges

  2016cites this paper
• Robust deadlock avoidance for sequential resource allocation systems with resource outages

  2016cites this paper
• A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems

  2015cites this paper
• On the Complexity of Some State-Counting Problems for Bounded Petri Nets

  2015cites this paper
• Deadlock Avoidance Policies for Automated Manufacturing Systems Using Finite State Automata

  2014cites this paper
• The deadlock problem in the control of Flexible Manufacturing Systems: An overview of the Petri net approach

  2014cites this paper
• Optimal Supervisory Control of Flexible Manufacturing Systems by Petri Nets: A Set Classification Approach

  2014cites this paper
• Symbolic Supervisory Control of Resource Allocation Systems

  2014cites this paper
• Deadlock Avoidance Policies in Production Systems by a Digraph Approach

  2014cites this paper
• Symbolic computation and representation of deadlock avoidance policies for complex resource allocation systems with application to multithreaded software

  2014cites this paper
• Efficient Enumeration of Minimal Unsafe States in Complex Resource Allocation Systems

  2014cites this paper
• Integrated design of optimal supervisors for the enforcement of static and behavioral specifications in Petri net models

  2013cites this paper
• Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights

  2013cites this paper
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case

  2012cites this paper
• Designing parsimonious representations of the maximally permissive deadlock avoidance policy for complex resource allocation systems through classification theory

  2012cites this paper
• Explicit storage and analysis of billions of states using commodity computers

  2012influential citation
• An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems

  2012cites this paper
• Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case

  2011cites this paper