Infinite- and \(K\)-step opacity verification of discrete-event systems under nondeterministic observations

Cites Work

Unnamed Item
Unnamed Item
Comparative analysis of related notions of opacity in centralized and coordinated architectures
Verification of initial-state opacity in security applications of discrete event systems
Enforcement and validation (at runtime) of various notions of opacity
Observability of Boolean control networks with time-variant delays in states
Synthesis of minimally restrictive optimal stability-enforcing supervisors for nondeterministic discrete event systems
Opacity of networked discrete event systems
Detectability verification of probabilistic Boolean networks
Enforcement for infinite-step opacity and K-step opacity via insertion mechanism
Verification of \(K\)-step and infinite-step opacity of bounded labeled Petri nets
A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
Nonblocking Supervisory Control of Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions
Introduction to Discrete Event Systems
Synthesis of Dynamic Masks for Infinite-Step Opacity
Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement
Opacity Enforcement Using Nondeterministic Publicly Known Edit Functions
Supervisor Synthesis for Mealy Automata With Output Functions: A Model Transformation Approach
Verification of State-Based Opacity Using Petri Nets
Verification of Codiagnosability for Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions
Verification of Infinite-Step Opacity and Complexity Considerations
Control of Networked Discrete Event Systems: Dealing with Communication Delays and Losses
Enforcing opacity by insertion functions under multiple energy constraints

This page was built for publication: Infinite- and \(K\)-step opacity verification of discrete-event systems under nondeterministic observations