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

Abstract 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.
AbstractList 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.
Author Zhang, Renyuan
Wang, Zenghui
Cai, Kai
Author_xml – sequence: 1
  givenname: Renyuan
  surname: Zhang
  fullname: Zhang, Renyuan
  email: ryzhang@nwpu.edu.cn
  organization: Northwestern Polytechnical University,School of Automation,Xi'an,China
– sequence: 2
  givenname: Zenghui
  surname: Wang
  fullname: Wang, Zenghui
  organization: Northwestern Polytechnical University,School of Automation,Xi'an,China
– sequence: 3
  givenname: Kai
  surname: Cai
  fullname: Cai, Kai
  email: kai.cai@eng.osaka-cu.ac.jp
  organization: Osaka City University,Department of Electrical and Information Engineering,Osaka,Japan
BookMark eNotj91KwzAYQKMouM09gQh9gdQkX5Imd0o3f2DMi-r1SNuvUu2akcRB396BgwPn7sCZk6vRj0jIPWc558w-lKtSKmlkLpjgudUGlIULsrSF4VorCVpZdUlmQhWaCijYDZnH-M0YWCthRh63tEp4yLZ-rAff_PTjV1b9HjAc--jDlJV-TMEPme-yVR-bgAnp-ohjyqopJtzHW3LduSHi8uwF-Xxef5SvdPP-8lY-bWgvGCQqpUPDW2ZYx6WynTshWIvOmNrWQkCD0IKuse64li3nKBANK8CdvrRrYEHu_rs9Iu4Ood-7MO3Ow_AHr2JMjA
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/CDC45484.2021.9683593
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781665436595
166543659X
EISSN 2576-2370
EndPage 344
ExternalDocumentID 9683593
Genre orig-research
GrantInformation_xml – fundername: Natural Science Foundation of Shaanxi Province
  funderid: 10.13039/501100007128
GroupedDBID 6IE
6IH
6IL
6IN
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i203t-44ae81d080f1459fa9fa20dea88b9b223ce3d36bebf164d11e2ee8073a0216ac3
IEDL.DBID RIE
IngestDate Wed Aug 27 03:00:23 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-44ae81d080f1459fa9fa20dea88b9b223ce3d36bebf164d11e2ee8073a0216ac3
PageCount 6
ParticipantIDs ieee_primary_9683593
PublicationCentury 2000
PublicationDate 2021-Dec.-14
PublicationDateYYYYMMDD 2021-12-14
PublicationDate_xml – month: 12
  year: 2021
  text: 2021-Dec.-14
  day: 14
PublicationDecade 2020
PublicationTitle Proceedings of the IEEE Conference on Decision & Control
PublicationTitleAbbrev CDC
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0039943
Score 1.8242674
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 339
SubjectTerms Automata
Conferences
Discrete-event systems
Supervisory control
Task analysis
Title N-Step Nonblocking Supervisory Control of Discrete-Event Systems
URI https://ieeexplore.ieee.org/document/9683593
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1La4NAEB6SnNpLH0npmz30WI2PdaO3gkkIhYRCG8gt7LojhIJKqof213dWTfqgh4IHEXwwq998zn7zLcBdEtCLI42_ndKhxVWoCQd9o7LwlCtCRyapmdGdL8RsyR9XwaoD9_teGESsxWdom916Ll_nSWVKZcNIEF-I_C50R6FoerV2qEt5lvtth47rRMN4HHMi46Zq4rl2e-KPFVTqBDI9gvnu1o1u5NWuSmUnH79cGf_7bMcw-GrVY0_7JHQCHcxO4fCby2AfHgg0SyzYIs8UpS5TG2fPVWFA4i3fvrO4UauzPGXjDaEI0WhrYmSQrLUzH8ByOnmJZ1a7cIK18Ry_tDiXSDyUyGDq8iBKJW2eo1GGoYoUEYIEfe0LhSqlvyXtuughhvSxSwqWkIl_Br0sz_AcWGriNyJOJ5KIaymVY-x3nBSFJm4mgwvom1isi8YbY92G4fLvw1dwYK5n5CAuv4Zeua3whpJ6qW7r0fwEKhOhhA
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT4NAEJ7UelAvPlrj2z14FMpjQbiZ0DZV28bENumt2WWHpDGBpsJBf72zQOsjHkw4EBIemYVvPma_-RbgJvboxRHa306qwOAyUISDrlZZONL2A0vEiZ7RHY39wZQ_zrxZA243vTCIWIrP0NS75Vy-yuJCl8o6oU98IXS3YNvjnHtVt9YadynTcrfu0bGtsBN1I050XNdNHNusT_2xhkqZQvr7MFrfvFKOvJpFLs3445cv43-f7gDaX8167HmThg6hgekR7H3zGWzBPcFmjks2zlJJyUtXx9lLsdQw8Zat3llU6dVZlrDugnCEiLTR00JIVhuat2Ha702igVEvnWAsHMvNDc4FEhMlOpjY3AsTQZtjKRRBIENJlCBGV7m-RJnQ_5KybXQQA_rcBQXLF7F7DM00S_EEWKLjd0eszo9DroSQljbgsRL0FbEz4Z1CS8divqzcMeZ1GM7-PnwNO4PJaDgfPoyfzmFXX1uLQ2x-Ac18VeAlpfhcXpUj-wnQbqTR
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+IEEE+Conference+on+Decision+%26+Control&rft.atitle=N-Step+Nonblocking+Supervisory+Control+of+Discrete-Event+Systems&rft.au=Zhang%2C+Renyuan&rft.au=Wang%2C+Zenghui&rft.au=Cai%2C+Kai&rft.date=2021-12-14&rft.pub=IEEE&rft.eissn=2576-2370&rft.spage=339&rft.epage=344&rft_id=info:doi/10.1109%2FCDC45484.2021.9683593&rft.externalDocID=9683593