Supervisory control theory provides means to synthesize supervisors for systems with discrete-event behavior from models of the uncontrolled plant and of the control requirements. The applicability of supervisory control theory often fails due to a lack of scalability of the algorithms. This paper proposes a format for the requirements and a method to ensure that the crucial properties of controllability and nonblockingness directly hold, thus avoiding the most computationally expensive parts of synthesis. The method consists of creating a control problem dependency graph and verifying whether it is acyclic. Vertices of the graph are modular plant components, and edges are derived from the requirements. In case of a cyclic graph, potential blocking issues can be localized, so that the original control problem can be reduced to only synthesizing supervisors for smaller partial control problems. The strength of the method is illustrated on two case studies: a production line and a roadway tunnel.

监督控制理论提供了一种手段，可以根据不受控制的工厂和控制需求的模型，为具有离散事件行为的系统综合监督员。由于缺乏算法的可扩展性，监督控制理论的适用性通常会失败。本文提出了一种要求格式，并提出了一种方法，以确保直接保持可控制性和非阻塞性的关键属性，从而避免了计算中最昂贵的部分。该方法包括创建控制问题依赖图并验证其是否为非循环。图的顶点是模块化的工厂组件，并且边线是从需求中得出的。如果是循环图，则可以定位潜在的阻塞问题，这样就可以将原始控制问题简化为仅针对较小的局部控制问题综合管理程序。在两个案例研究中说明了该方法的优势：一条生产线和一条巷道。