.png){kind=icon}
.png){kind=icon}
Return
On Distributed and Parameterized Supervisor Synthesis Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2015.2447193.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is shown that the problem whether an arbitrary regular language has a non-empty decomposable sublanguage with respect to a fixed distribution is decidable if and only if the independence relation induced by the distribution is transitive. A sufficient condition on the distributed control architecture is then derived, under which there exist some fixed non-blocking local generators such that the distributed supervisor synthesis problem is undecidable. We also show that a natural formulation of the parameterized supervisor synthesis problem is undecidable for a fixed non-blocking generator template, so long as the template alphabet has at least two private events and one global event that are controllable. In particular, all the undecidability results are still valid even if star free specification languages are considered.
Keywords:
Discrete-event systems
distributed synthesis
parameterized
synthesis
supervisory control
trace theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W