Comparing the notions of opacity for discrete-event systems

DOI10.1007/s10626-021-00344-2zbMath1480.93256arXiv2102.02889OpenAlexW3186412919MaRDI QIDQ2063098

Jiří Balun, Tomáš Masopust

Publication date: 10 January 2022

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.02889

zbMATH Keywords

complexitytransformationsfinite automatadiscrete event systemsopacity

Mathematics Subject Classification ID

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

Related Items

Enforcement for infinite-step opacity and K-step opacity via insertion mechanism, Strong current-state and initial-state opacity of discrete-event systems, State-based opacity of labeled real-time automata, Verifying weak and strong \(k\)-step opacity in discrete-event systems

Uses Software

• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparative analysis of related notions of opacity in centralized and coordinated architectures
• On a structural property in the state complexity of projected regular languages
• Synthesis of opaque systems with static and dynamic masks
• Descriptional and computational complexity of finite automata -- a survey
• Opacity of discrete event systems and its applications
• The method of forced enumeration for nondeterministic automata
• Space-bounded reducibility among combinatorial problems
• The inclusion problem for some subclasses of context-free languages
• A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
• Transition complexity of language operations
• Concurrent secrets
• Introduction to Discrete Event Systems
• Preserving Secrecy Under Refinement
• Nondeterministic Space is Closed under Complementation
• CSP and anonymity
• Computational Complexity
• Verification of Infinite-Step Opacity and Complexity Considerations