Verification of current-state opacity in discrete event systems by using basis coverability graphs
| dc.contributor.author | Zhu, Haoming | |
| dc.contributor.author | El-Sherbeeny, Ahmed M. | |
| dc.contributor.author | El-Meligy, Mohammed A. | |
| dc.contributor.author | Fathollahi-Fard, Amir M. | |
| dc.contributor.author | Li, Zhiwu | |
| dc.date.accessioned | 2024-02-02T22:22:27Z | |
| dc.date.available | 2024-02-02T22:22:27Z | |
| dc.date.copyright | 2023 | en_US |
| dc.date.issued | 2023 | |
| dc.description.abstract | A new approach to the verification of current-state opacity for discrete event systems is proposed in this paper, which is modeled with unbounded Petri nets. The concept of opacity verification is first extended from bounded Petri nets to unbounded Petri nets. In this model, all transitions and partial places are assumed to be unobservable, i.e., only the number of tokens in the observable places can be measured. In this work, a novel basis coverability graph is constructed by using partial markings and quasi-observable transitions. By this graph, this research finds that an unbounded net system is current-state opaque if, for an arbitrary partial marking, there always exists at least one regular marking in the result of current-state estimation with respect to the partial marking not belonging to the given secret. Finally, a sufficient and necessary condition is proposed for the verification of current-state opacity. A manufacturing system example is presented to illustrate that the concept of current-state opacity can be verified for unbounded net systems. | en_US |
| dc.description.reviewstatus | Reviewed | en_US |
| dc.description.scholarlevel | Faculty | en_US |
| dc.description.sponsorship | This research was funded by the Science and Technology Fund, FDCT, Macau SAR, under grant 0064/2021/A2, and by the Special Fund for Scientific and Technological Innovation Strategy of Guangdong Province under grant No. 2022A0505030025. The authors extend their appreciation to King Saud University, Saudi Arabia, for funding this work through Researchers Supporting Project number (RSP2023R133), King Saud University, Riyadh, Saudi Arabia. | en_US |
| dc.identifier.citation | Zhu, H., El-Sherbeeny, A. M., El-Meligy, M. A., Fathollahi-Fard, A. M., & Li, Z. (2023). Verification of current-state opacity in discrete event systems by using basis coverability graphs. Mathematics, 11(8), 1798. https://doi.org/10.3390/math11081798 | en_US |
| dc.identifier.uri | https://doi.org/10.3390/math11081798 | |
| dc.identifier.uri | http://hdl.handle.net/1828/15931 | |
| dc.language.iso | en | en_US |
| dc.publisher | Mathematics | en_US |
| dc.subject | basis coverability graph | en_US |
| dc.subject | discrete event system | en_US |
| dc.subject | Petri net | en_US |
| dc.subject | current-state opacity | en_US |
| dc.title | Verification of current-state opacity in discrete event systems by using basis coverability graphs | en_US |
| dc.type | Article | en_US |