Verification of current-state opacity and opaque time for labeled time Petri net systems

IF 4.8 2区计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Automatica Pub Date : 2025-03-09 DOI:10.1016/j.automatica.2025.112241

Yuting Wang , Liang Li , Zhiwu Li

{"title":"Verification of current-state opacity and opaque time for labeled time Petri net systems","authors":"Yuting Wang , Liang Li , Zhiwu Li","doi":"10.1016/j.automatica.2025.112241","DOIUrl":null,"url":null,"abstract":"<div><div>This paper investigates the verification of current-state opacity and opaque time in timed discrete event systems modeled with labeled time Petri nets (LTPNs). First, we formally conceptualize current-state opacity and opaque time for LTPN systems. Based on the solution of a set of linear programming problems (LPPs) associated with the transitions-related timing constraints in the modified state class graph (MSCG) of an LTPN system, an approach is proposed to find all the state classes and logic transition sequences that the system may generate at a given time instant. By utilizing such state classes and logic transition sequences, a method for verifying the current-state opacity of an LTPN system is presented, avoiding an exhaustive enumeration of the state classes that are consistent with all the observable label sequences at the time instant. To further acquire the current-state opaque time of the LTPN system, we propose a method for calculating the length of opaque time based on the solution of LPPs that are associated with the paths in the MSCG. Particularly, an algorithm is reported to compute the opaque time of an LTPN system with respect to a given secret. Finally, a case study is provided to illustrate the proposed algorithms to determine the current-state opacity and opaque time for an LTPN system.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"176 ","pages":"Article 112241"},"PeriodicalIF":4.8000,"publicationDate":"2025-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109825001335","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

This paper investigates the verification of current-state opacity and opaque time in timed discrete event systems modeled with labeled time Petri nets (LTPNs). First, we formally conceptualize current-state opacity and opaque time for LTPN systems. Based on the solution of a set of linear programming problems (LPPs) associated with the transitions-related timing constraints in the modified state class graph (MSCG) of an LTPN system, an approach is proposed to find all the state classes and logic transition sequences that the system may generate at a given time instant. By utilizing such state classes and logic transition sequences, a method for verifying the current-state opacity of an LTPN system is presented, avoiding an exhaustive enumeration of the state classes that are consistent with all the observable label sequences at the time instant. To further acquire the current-state opaque time of the LTPN system, we propose a method for calculating the length of opaque time based on the solution of LPPs that are associated with the paths in the MSCG. Particularly, an algorithm is reported to compute the opaque time of an LTPN system with respect to a given secret. Finally, a case study is provided to illustrate the proposed algorithms to determine the current-state opacity and opaque time for an LTPN system.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

求助全文

约1分钟内获得全文去求助

来源期刊

Automatica 工程技术-工程：电子与电气

CiteScore

10.70

自引率

7.80%

发文量

617

审稿时长

5 months

期刊介绍： Automatica is a leading archival publication in the field of systems and control. The field encompasses today a broad set of areas and topics, and is thriving not only within itself but also in terms of its impact on other fields, such as communications, computers, biology, energy and economics. Since its inception in 1963, Automatica has kept abreast with the evolution of the field over the years, and has emerged as a leading publication driving the trends in the field. After being founded in 1963, Automatica became a journal of the International Federation of Automatic Control (IFAC) in 1969. It features a characteristic blend of theoretical and applied papers of archival, lasting value, reporting cutting edge research results by authors across the globe. It features articles in distinct categories, including regular, brief and survey papers, technical communiqués, correspondence items, as well as reviews on published books of interest to the readership. It occasionally publishes special issues on emerging new topics or established mature topics of interest to a broad audience. Automatica solicits original high-quality contributions in all the categories listed above, and in all areas of systems and control interpreted in a broad sense and evolving constantly. They may be submitted directly to a subject editor or to the Editor-in-Chief if not sure about the subject area. Editorial procedures in place assure careful, fair, and prompt handling of all submitted articles. Accepted papers appear in the journal in the shortest time feasible given production time constraints.

期刊最新文献

Editorial Board Rank resilience of pattern matrices against structured perturbations with applications Verification of current-state opacity and opaque time for labeled time Petri net systems Maximizing the smallest eigenvalue of grounded Laplacian matrices via edge addition Probabilistic reachable sets of stochastic nonlinear systems with contextual uncertainties