State-based opacity of labeled real-time automata

DOI10.1016/j.tcs.2023.114373OpenAlexW4390399279MaRDI QIDQ6122597

Kuize Zhang

Publication date: 1 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114373

zbMATH Keywords

verificationobserverlabeled real-time automatonstate-based opacity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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
• Synthesis of obfuscation policies to ensure privacy and utility
• Opacity of discrete event systems and its applications
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Subclasses of Presburger arithmetic and the polynomial-time hierarchy
• Comparing the notions of opacity for discrete-event systems
• Detectability of labeled weighted automata over monoids
• Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
• Decidability of opacity verification problems in labeled Petri net systems
• A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
• The Exact Path Length Problem
• Process Algebra Contexts and Security Properties
• Process Opacity for Timed Process Algebra
• Dynamic Observers for the Synthesis of Opaque Systems
• Subclasses of presburger arithmetic and the weak EXP hierarchy
• The Complexity of Diagnosability and Opacity Verification for Petri Nets
• Estimation and Inference in Discrete Event Systems
• Verification of Infinite-Step Opacity and Complexity Considerations
• Decidability of the initial-state opacity of real-time automata

This page was built for publication: State-based opacity of labeled real-time automata