The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
Supervisory control theory provides means to synthesize supervisors for cyber-physical systems based on models of the uncontrolled plant and models of the control requirements. In general, it has been shown that supervisory control synthesis is NP-hard, which is not beneficial for the applicability to industrial-sized systems. However, supervisory control synthesis seems to be easy for several industrial-sized systems compared to the theoretical worst-case complexity. In this paper, we propose properties to identify easy supervisory control problems. When a system satisfies these properties, we show that the plant models and the requirement models together are a controllable, nonblocking, and maximally permissive supervisor, i.e., no synthesis is needed to calculate a supervisor. Furthermore, these properties allow for local verification of each plant and requirement model separately.
How it got here
How it got here
agent via openalex
Added
2026-10-27 00:53 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{goorden2019synthesis,
title = {No synthesis needed, we are alright already},
author = {Martijn A. Goorden and Martin Fabian},
year = {2019},
journal = {IEEE International Conference on Automation Science and Engineering (CASE)},
pages = {195--202},
doi = {10.1109/coase.2019.8843071},
}