In supervisory control theory (SCT) the supremal supervisor (representing the supremal controllable sublanguage) typically has a large state size (of order the product of state sizes of the plant and specification automata). In this paper, we propose an algorithm which can significantly reduce supervisor size while preserving control action. We also show that finding a supervisor of minimal size is NP-hard.
|Journal||Discrete Event Dynamic Systems|
|Publication status||Published - 2004|