Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
From MaRDI portal
Publication:1737732
DOI10.1016/j.automatica.2018.12.019zbMath1415.93062arXiv1710.02877MaRDI QIDQ1737732
Publication date: 24 April 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.02877
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
93C65: Discrete event control/observation systems
93B07: Observability
68Q80: Cellular automata (computational aspects)
Related Items
Unnamed Item, On verification of D-detectability for discrete event systems, An improved approach for verifying delayed detectability of discrete-event systems, Initial-state detectability and initial-state opacity of unambiguous weighted automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Synthesis of opaque systems with static and dynamic masks
- Generalized detectability for discrete event systems
- Opacity of discrete event systems and its applications
- Multi-level hierarchical interface-based supervisory control
- Verification complexity of a class of observational properties for modular discrete events systems
- PSPACE-completeness of modular supervisory control problems
- Complexity of deciding detectability in discrete event systems
- Coordination control of discrete-event systems revisited
- The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
- Introduction to Discrete Event Systems
- Complexity of Verifying Nonblockingness in Modular Supervisory Control
- Diagnosability of discrete-event systems
- Supervisory Control Architecture for Discrete-Event Systems
- Diagnosability of stochastic discrete-event systems
- Hierarchical interface-based supervisory control-part II: parallel case
- Detectability of Discrete Event Systems
- On Tractable Instances of Modular Supervisory Control
- Efficient Abstractions for the Supervisory Control of Modular Discrete Event Systems
