N-Step Nonblocking Supervisory Control of Discrete-Event Systems

In this paper, we propose a new automaton property of N-step nonblockingness for a given positive integer N. This property quantifies the standard nonblocking property by capturing the practical requirement that all tasks be completed within a bounded number of steps. Accordingly, we formulate a new...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the IEEE Conference on Decision & Control pp. 339 - 344
Main Authors Zhang, Renyuan, Wang, Zenghui, Cai, Kai
Format Conference Proceeding
LanguageEnglish
Published IEEE 14.12.2021
Subjects
Automata
Conferences
Discrete-event systems
Supervisory control
Task analysis
Online AccessGet full text
ISSN2576-2370
DOI10.1109/CDC45484.2021.9683593

Cover

More Information
Summary:In this paper, we propose a new automaton property of N-step nonblockingness for a given positive integer N. This property quantifies the standard nonblocking property by capturing the practical requirement that all tasks be completed within a bounded number of steps. Accordingly, we formulate a new N-step nonblocking supervisory control problem, and characterize its solvability in terms of a new concept of N-step language completability. It is proved that there exists a unique supremal N-step completable sublanguage of a given language, and we develop a generator-based algorithm to compute the supremal sublanguage. Finally, together with the supremal controllable sublanguage, we design an algorithm to compute a maximally permissive supervisory control solution to the new N-step nonblocking supervisory control problem.
ISSN:2576-2370
DOI:10.1109/CDC45484.2021.9683593