Verification complexity of a class of observational properties for modular discrete events systems
From MaRDI portal
Publication:1679097
DOI10.1016/J.AUTOMATICA.2017.06.013zbMATH Open1373.93220OpenAlexW2730583255MaRDI QIDQ1679097FDOQ1679097
Authors: Xiang Yin, Stéphane Lafortune 
Publication date: 8 November 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.06.013
Recommendations
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Diagnosability of discrete event systems with modular structure
- Verification of robust diagnosability for partially observed discrete event systems
- Complexity of deciding detectability in discrete event systems
- On verification of D-detectability for discrete event systems
Complexity and performance of numerical algorithms (65Y20) Observability (93B07) Discrete event control/observation systems (93C65)
Cites Work
- Title not available (Why is that?)
- Diagnosability Analysis of Discrete Event Systems with Autonomous Components
- Relationships between nondeterministic and deterministic tape complexities
- Introduction to Discrete Event Systems
- Predictability of event occurrences in partially-observed discrete-event systems
- A polynomial algorithm for testing diagnosability of discrete-event systems
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
- Title not available (Why is that?)
- Fault diagnosis with static and dynamic observers
- Diagnosability of discrete-event systems
- On the control of discrete-event dynamical systems
- Distributed monitoring of concurrent and asynchronous systems
- Multi-level hierarchical interface-based supervisory control
- Supervisory Control Architecture for Discrete-Event Systems
- Hierarchical interface-based supervisory control-part II: parallel case
- On observability of discrete-event systems
- Supervisory control of modular systems with global specification languages
- On the complexity of synthesizing a minimum-weighted supervisor under partial observation
- Verification of Infinite-Step Opacity and Complexity Considerations
- Detectability of Discrete Event Systems
- Diagnosability of discrete event systems with modular structure
- On Codiagnosability and Coobservability With Dynamic Observations
- The Complexity of Codiagnosability for Discrete Event and Timed Systems
- Codiagnosability and coobservability under dynamic observations: transformation and verification
- PSPACE-completeness of modular supervisory control problems
- Deciding co-observability is pspace-complete
- Efficient Abstractions for the Supervisory Control of Modular Discrete Event Systems
- On Tractable Instances of Modular Supervisory Control
Cited In (13)
- Verification of $k$-Step and Definite Critical Observability in Discrete-Event Systems
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Deciding detectability for labeled Petri nets
- Trajectory detectability of discrete-event systems
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets
- On detectability of labeled Petri nets and finite automata
- Complexity of deciding detectability in discrete event systems
- On verification of D-detectability for discrete event systems
- An improved approach for verifying delayed detectability of discrete-event systems
- Current-state opacity and initial-state opacity of modular discrete event systems
- Diagnosability of discrete event systems with modular structure
- Title not available (Why is that?)
- Computation of minimal diagnosis bases of discrete-event systems using verifiers
Uses Software
This page was built for publication: Verification complexity of a class of observational properties for modular discrete events systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679097)
