EconPapers    
Economics at your fingertips  
 

Verification of Opacity Under a K -Delay Orwellian Observation Mechanism

Jiahui Zhang, Kuize Zhang, Xiaoguang Han and Zhiwu Li ()
Additional contact information
Jiahui Zhang: Institute of Systems Engineering, Macau University of Science and Technology, Taipa, Macau SAR 999078, China
Kuize Zhang: School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an 710049, China
Xiaoguang Han: College of Electronic Information and Automation, Tianjin University of Science and Technology, Tianjin 300457, China
Zhiwu Li: Institute of Systems Engineering, Macau University of Science and Technology, Taipa, Macau SAR 999078, China

Mathematics, 2025, vol. 13, issue 10, 1-23

Abstract: Opacity, an important property of the information flow in discrete-event systems (DESs), characterizes whether the secret information in a system is ambiguous to a passive observer (called an intruder). Observation models play a critical role in the analysis of opacity. In this paper, instead of adopting a fully static observation model or a fully dynamic observation model, we use a novel Orwellian-type observation model to study the verification of the current-state opacity (CSO), where the observability of an unobservable event can be re-interpreted once certain/several specific conditions are met. First, a K -delay Orwellian observation mechanism (KOOM) is proposed as a novel Orwellian-type observation mechanism for extending the existing Orwellian projection. The main characteristics of the KOOM are delaying the inevitable information release and narrowing the release range for historical information to protect the secrets in a system to a greater extent than with the existing Orwellian projection. Second, we formulate the definitions of standard and strong CSO under the KOOM. Finally, we address the verification problem for these two types of opacity by constructing two novel information structures called a standard K -delay verifier and a strong K -delay verifier, respectively. An analysis of the computational complexity and illustrative examples are also presented for the proposed results. Overall, the proposed notions of standard and strong CSO under the KOOM capture the security privacy requirements regarding a delayed release in applications, such as intelligent transportation systems, etc.

Keywords: discrete-event system; opacity; information release; K -delay Orwellian observation; verifier (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/10/1568/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/10/1568/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:10:p:1568-:d:1652739

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-05-10
Handle: RePEc:gam:jmathe:v:13:y:2025:i:10:p:1568-:d:1652739