Verification complexity of a class of observational properties for modular discrete events systems
type: Item
instance of: scholarly article
title: Verification complexity of a class of observational properties for modular discrete events systems
zbMATH Open document ID: 1373.93220
author: Xiang Yin
author: Stéphane Lafortune
published in: Automatica
publication date: 2017-11-08T00:00:00Z
Mathematics Subject Classification ID: 93C65
Mathematics Subject Classification ID: 93B07
Mathematics Subject Classification ID: 93B40
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6803937
zbMATH Keywords: computational complexity
zbMATH Keywords: PSPACE-completeness
zbMATH Keywords: modular diagnosis
zbMATH Keywords: discrete event systems
describes a project that uses: UMDES
MaRDI profile type: Publication
full work available at URL: j.automatica.2017.06.013
OpenAlex ID: W2730583255
cites work: Introduction to Discrete Event Systems
cites work: The Complexity of Codiagnosability for Discrete Event and Timed Systems
cites work: Q3602752
cites work: Diagnosability of discrete event systems with modular structure
cites work: Distributed monitoring of concurrent and asynchronous systems
cites work: Supervisory Control Architecture for Discrete-Event Systems
cites work: Q4198056
cites work: Predictability of event occurrences in partially-observed discrete-event systems
cites work: On Tractable Instances of Modular Supervisory Control
cites work: Multi-level hierarchical interface-based supervisory control
cites work: Q5592246
cites work: A polynomial algorithm for testing diagnosability of discrete-event systems
cites work: Supervisory control of modular systems with global specification languages
cites work: Hierarchical interface-based supervisory control-part II: parallel case
cites work: On observability of discrete-event systems
cites work: Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
cites work: PSPACE-completeness of modular supervisory control problems
cites work: Deciding co-observability is pspace-complete
cites work: Verification of Infinite-Step Opacity and Complexity Considerations
cites work: Diagnosability of discrete-event systems
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Efficient Abstractions for the Supervisory Control of Modular Discrete Event Systems
cites work: Detectability of Discrete Event Systems
cites work: On the complexity of synthesizing a minimum-weighted supervisor under partial observation
cites work: On the control of discrete-event dynamical systems
cites work: On Codiagnosability and Coobservability With Dynamic Observations
cites work: Diagnosability Analysis of Discrete Event Systems with Autonomous Components
cites work: Codiagnosability and coobservability under dynamic observations: transformation and verification
cites work: Polynomial-time verification of diagnosability of partially observed discrete-event systems
DOI: 10.1016/J.AUTOMATICA.2017.06.013
description: scientific article; zbMATH DE number 6803937