Verification complexity of a class of observational properties for modular discrete events systems
From MaRDI portal
Publication:1679097
DOI10.1016/j.automatica.2017.06.013zbMath1373.93220OpenAlexW2730583255MaRDI QIDQ1679097
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
Discrete event control/observation systems (93C65) Observability (93B07) Complexity and performance of numerical algorithms (65Y20)
Related Items (9)
Current-state opacity and initial-state opacity of modular discrete event systems ⋮ An improved approach for verifying delayed detectability of discrete-event systems ⋮ On detectability of labeled Petri nets and finite automata ⋮ Trajectory detectability of discrete-event systems ⋮ Complexity of detectability, opacity and A-diagnosability for modular discrete event systems ⋮ Deciding detectability for labeled Petri nets ⋮ Complexity of deciding detectability in discrete event systems ⋮ Analysis of strong and strong periodic detectability of bounded labeled Petri nets ⋮ On verification of D-detectability for discrete event systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of synthesizing a minimum-weighted supervisor under partial observation
- Diagnosability of discrete event systems with modular structure
- Codiagnosability and coobservability under dynamic observations: transformation and verification
- Multi-level hierarchical interface-based supervisory control
- Predictability of event occurrences in partially-observed discrete-event systems
- On observability of discrete-event systems
- On the control of discrete-event dynamical systems
- Distributed monitoring of concurrent and asynchronous systems
- PSPACE-completeness of modular supervisory control problems
- Supervisory control of modular systems with global specification languages
- Relationships between nondeterministic and deterministic tape complexities
- Diagnosability Analysis of Discrete Event Systems with Autonomous Components
- Introduction to Discrete Event Systems
- A polynomial algorithm for testing diagnosability of discrete-event systems
- Diagnosability of discrete-event systems
- Supervisory Control Architecture for Discrete-Event Systems
- Deciding co-observability is pspace-complete
- Polynomial-time verification of diagnosability of partially observed discrete-event systems
- Hierarchical interface-based supervisory control-part II: parallel case
- Detectability of Discrete Event Systems
- On Codiagnosability and Coobservability With Dynamic Observations
- On Tractable Instances of Modular Supervisory Control
- Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
- Verification of Infinite-Step Opacity and Complexity Considerations
- The Complexity of Codiagnosability for Discrete Event and Timed Systems
- Efficient Abstractions for the Supervisory Control of Modular Discrete Event Systems
This page was built for publication: Verification complexity of a class of observational properties for modular discrete events systems