离散事件系统中局部观测一致性的复杂性
Complexity of Local Observation Consistency in Discrete-Event Systems
中文总结 AI 辅助
本文研究离散事件系统中局部观测一致性（LOC）与局部重标注观测一致性（LROC）的复杂性，证明非确定性被控对象下二者为PSpace完全问题，确定性被控对象下可多项式时间判定，为相关控制应用提供理论依据。
中文摘要 AI 辅助
部分观测下的分层与多智能体监督控制依赖于被控对象（plant）与其抽象模型间的局部一致性条件：分层控制的投影抽象对应局部观测一致性（LOC），多智能体系统的重标注抽象对应局部重标注观测一致性（LROC）。二者均为全局条件的配套条件，且已被应用但未确定其验证复杂性。本文证明，对于非确定性被控对象，LOC与LROC均为PSpace完全问题；对于确定性被控对象，二者可在多项式时间内判定。
英文摘要
Hierarchical and multi-agent supervisory control under partial observation relies on local consistency conditions between a plant and its abstraction: local observation consistency (LOC) for the projection abstractions of hierarchical control, and local relabeling observation consistency (LROC) for the relabeling abstractions of multi-agent systems. Both are companions to a global condition and both have been used without their verification complexity being settled. We show that both are PSpace-complete for nondeterministic plants and decidable in polynomial time for deterministic plants.
