{"title":"Opacity Verification for a Class of Modular Discrete Event Systems","authors":"Jingkai Yang;Weilin Deng","doi":"10.1109/ACCESS.2025.3554636","DOIUrl":null,"url":null,"abstract":"The verification of opacity of discrete event systems (DESs) is subjected to the curse of dimensionality because this issue has been proven to be EXPSPACE-complete. Therefore, how to improve the efficiency of opacity verification in DESs is crucial. We discuss in this paper the verification of several classes of opacity in modular discrete event systems (modular DESs) formalized as Cartesian composition of deterministic finite state automata. We derive the sufficient and necessary conditions for these opacity notions in modular DESs. Many examples are also used to explain the results obtained in this article. These results greatly reduce the computational complexity of verifying the opacity for modular DESs.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"54080-54089"},"PeriodicalIF":3.4000,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10938566","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10938566/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
The verification of opacity of discrete event systems (DESs) is subjected to the curse of dimensionality because this issue has been proven to be EXPSPACE-complete. Therefore, how to improve the efficiency of opacity verification in DESs is crucial. We discuss in this paper the verification of several classes of opacity in modular discrete event systems (modular DESs) formalized as Cartesian composition of deterministic finite state automata. We derive the sufficient and necessary conditions for these opacity notions in modular DESs. Many examples are also used to explain the results obtained in this article. These results greatly reduce the computational complexity of verifying the opacity for modular DESs.
IEEE AccessCOMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍:
IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest.
IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on:
Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals.
Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering.
Development of new or improved fabrication or manufacturing techniques.
Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.