Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/COASE.2019.8843071 | 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE) |
Keywords | Field | DocType |
supervisory control theory,cyber-physical systems,uncontrolled plant,supervisory control synthesis,industrial-sized systems,plant models,requirement models,controllable supervisor,maximally permissive supervisor,requirement model,nonblocking supervisor | Supervisor,Supervisory control,Computer science,Automaton,Supervisory control theory,Control engineering,Cyber-physical system | Conference |
ISSN | ISBN | Citations |
2161-8070 | 978-1-7281-0357-0 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martijn Goorden | 1 | 2 | 1.40 |
| Martin Fabian | 2 | 204 | 27.91 |