Quantifying opacity of discrete event systems modeled with probabilistic Petri nets

DOI10.1016/J.INS.2024.120434MaRDI QIDQ6539394zbMATH OpenFDO

Authors Sian Zhou, Li Yin, Zhiwu Li

Publication date 14 May 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.120434

zbMATH Keywords

discrete event systemprobabilistic Petri networthy opacity

Mathematics Subject Classification ID

Networked control (93B70) Discrete event control/observation systems (93C65)

Recommendations

• Modelling opacity using Petri nets
• Verification of K-step and infinite-step opacity of bounded labeled Petri nets
• Current-state opacity modelling and verification in partially observed Petri nets
• Quantifying opacity
• Opacity of networked discrete event systems

Cites work

• Current-State Opacity Formulations in Probabilistic Finite Automata
• Diagnosability of fault patterns with labeled stochastic Petri nets
• Exposure and Revelation Times as a Measure of Opacity in Timed Stochastic Discrete Event Systems
• Game current-state opacity formulation in probabilistic resource automata
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Infinite-step opacity and K-step opacity of stochastic discrete-event systems
• Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
• Introduction to Discrete Event Systems
• Modelling opacity using Petri nets
• On Approximate Opacity of Cyber-Physical Systems
• On-line verification of current-state opacity by Petri nets and integer linear programming
• Online verification of K-step opacity by Petri nets in centralized and decentralized structures
• Opacity of discrete event systems and its applications
• Probabilistic automata
• Probabilistic Marking Estimation in Labeled Petri Nets
• Probabilistic Supervisory Control of Probabilistic Discrete Event Systems
• Quantifying opacity
• Robust Fault Diagnosis of Stochastic Discrete Event Systems
• Strong current-state and initial-state opacity of discrete-event systems
• Undecidable problems for probabilistic automata of fixed dimension
• Verification and enforcement of strong infinite- and k-step opacity using state recognizers
• Verification of K-step and infinite-step opacity of bounded labeled Petri nets
• Verification of detectability in probabilistic finite automata
• Verification of Infinite-Step Opacity and Complexity Considerations
• Verification of initial-state opacity in security applications of discrete event systems
• Verification of State-Based Opacity Using Petri Nets

Cited in

(3)

• Game current-state opacity formulation in probabilistic resource automata
• Obfuscation mechanism for simultaneous public event information release and private event information hiding in discrete event systems
• A survey on performance evaluations in time-dependent Petri nets

This page was built for publication: Quantifying opacity of discrete event systems modeled with probabilistic Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539394)