Maximally Permissive Nonblocking Similarity Control of Nondeterministic Discrete Event Systems
Jinglun Li, Shigemasa Takai · 2020
In this paper, we study a nonblocking similarity control problem for nondeterministic discrete event systems (DESs), which requires us to synthesize a nonblocking supervisor such that the supervised system is simulated by the given specification. We propose an algorithm that computes a nonblocking supervisor from a possibly blocking one by iteratively removing certain states. To compute a maximally permissive nonblocking supervisor, the algorithm is applied to the supervisor synthesized without imposing nonblockingness. We show that a nonblocking supervisor is generated by the algorithm if and only if there exists a solution to the nonblocking similarity control problem, and the generated nonblocking supervisor is a maximally permissive one.