Synthesis of Optimal Insertion Functions for Opacity Enforcement

DOI10.1109/TAC.2015.2440632MaRDI QIDQ2980627zbMATH OpenFDO

Authors Yi-Chin Wu, Stéphane Lafortune

Publication date 3 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2015.2440632

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65)

Cited in

(13)

• Matrix approach for verification of opacity of partially observed discrete event systems
• Opacity of networked discrete event systems
• Relative predictability of failure event occurrences and its opacity-based test algorithm
• Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement
• Synthesis of insertion functions for enforcement of opacity security properties
• Optimal control strategy for k-level opaque systems based on the optimization method of multi-selection problems at each stage
• \(k\)-memory-embedded insertion mechanism for opacity enforcement
• Opacity Enforcement via Attribute-Based Edit Functions in the Presence of an Intended Receiver
• Opacity enforcement in discrete event systems using differential privacy
• Optimal supervisory control with mean payoff objectives and under partial observation
• Obfuscation mechanism for simultaneous public event information release and private event information hiding in discrete event systems
• Enforcement of opacity by public and private insertion functions
• Online verification of K-step opacity by Petri nets in centralized and decentralized structures

This page was built for publication: Synthesis of Optimal Insertion Functions for Opacity Enforcement

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