On the public citation graph

Complexity of detectability, opacity and A-diagnosability for modular discrete event systems

0 signed · 70 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-68612-7openalex-snapshot
Introduction to Discrete Event Systems
inferredcites →https://doi.org/10.1007/978-3-030-72274-6openalex-snapshot
Introduction to Discrete Event Systems
inferredcites →https://doi.org/10.1007/s10626-004-6210-5openalex-snapshot
PSPACE-completeness of Modular Supervisory Control Problems*
inferredcites →https://doi.org/10.1007/s10703-012-0141-9openalex-snapshot
Synthesis of opaque systems with static and dynamic masks
inferredcites →https://doi.org/10.1016/j.arcontrol.2013.09.009openalex-snapshot
Overview of fault diagnosis methods for Discrete Event Systems
inferredcites →https://doi.org/10.1016/j.arcontrol.2016.04.015openalex-snapshot
Overview of discrete event systems opacity: Models, validation, and quantification
inferredcites →https://doi.org/10.1016/j.automatica.2010.04.002openalex-snapshot
Multi-level hierarchical interface-based supervisory control
inferredcites →https://doi.org/10.1016/j.automatica.2011.01.002openalex-snapshot
Opacity of discrete event systems and its applications
inferredcites →https://doi.org/10.1016/j.automatica.2017.03.023openalex-snapshot
The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
inferredcites →https://doi.org/10.1016/j.automatica.2017.06.013openalex-snapshot
Verification complexity of a class of observational properties for modular discrete events systems
inferredcites →https://doi.org/10.1016/j.automatica.2018.03.077openalex-snapshot
Complexity of deciding detectability in discrete event systems
inferredcites →https://doi.org/10.1016/j.automatica.2018.12.019openalex-snapshot
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
inferredcites →https://doi.org/10.1016/j.sysconle.2011.02.001openalex-snapshot
Generalized detectability for discrete event systems
inferredcites →https://doi.org/10.1109/3477.875441openalex-snapshot
On the complexity of supervisory control design in the RW framework
inferredcites →https://doi.org/10.1109/9.412626openalex-snapshot
Diagnosability of discrete-event systems
inferredcites →https://doi.org/10.1109/cdc.1971openalex-snapshot
1971 IEEE Conference on Decision and Control
inferredcites →https://doi.org/10.1109/cdc.2007.4434515openalex-snapshot
Notions of security and opacity in discrete event systems
inferredcites →https://doi.org/10.1109/focs.1965.11openalex-snapshot
Hierarchies of memory limited computations
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1109/tac.2005.844722openalex-snapshot
Diagnosability of stochastic discrete-event systems
inferredcites →https://doi.org/10.1109/tac.2005.854612openalex-snapshot
Hierarchical interface-based supervisory control-part II: parallel case
inferredcites →https://doi.org/10.1109/tac.2007.910713openalex-snapshot
Detectability of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2008.927679openalex-snapshot
Supervisory Control Architecture for Discrete-Event Systems
inferredcites →https://doi.org/10.1109/tac.2010.2089563openalex-snapshot
On Tractable Instances of Modular Supervisory Control
inferredcites →https://doi.org/10.1109/tac.2012.2200373openalex-snapshot
Efficient Abstractions for the Supervisory Control of Modular Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2017.2726582openalex-snapshot
Complexity of Verifying Nonblockingness in Modular Supervisory Control
inferredcites →https://doi.org/10.1109/tase.2016.2551746openalex-snapshot
Revised Test for Stochastic Diagnosability of Discrete-Event Systems
inferredcites →https://doi.org/10.3182/20100830-3-de-4013.00015openalex-snapshot
Reduced-Complexity Verification for Initial-State Opacity in Modular Discrete Event Systems
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2014.417openalex-snapshot
Foundation of Diagnosis and Predictability in Probabilistic Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/047134608x.w8400openalex-snapshot
Estimation and Verification of Partially Observed Discrete‐Event Systems
inferred← citeshttps://doi.org/10.1007/s00034-020-01462-2openalex-snapshot
Matrix Approach for Verification of Opacity of Partially Observed Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/s10626-021-00357-xopenalex-snapshot
A general language-based framework for specifying and verifying notions of opacity
inferred← citeshttps://doi.org/10.1007/s11424-025-4348-4openalex-snapshot
Detectability of Discrete Event Systems Under Sensor Attacks
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2022.03.004openalex-snapshot
Secure-by-construction synthesis of cyber-physical systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2018.03.077openalex-snapshot
Complexity of deciding detectability in discrete event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.06.028openalex-snapshot
Enforcing opacity by insertion functions under multiple energy constraints
inferred← citeshttps://doi.org/10.1016/j.automatica.2020.109291openalex-snapshot
An improved approach for verifying delayed detectability of discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109490openalex-snapshot
Initial-state detectability and initial-state opacity of unambiguous weighted automata
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109884openalex-snapshot
On verification of D-detectability for discrete event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2026.113011openalex-snapshot
Diagnosability verification for automata and Petri nets: Can we do better?
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.2542openalex-snapshot
Enforcing Opacity in Modular Systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.002openalex-snapshot
Revisiting strong detectability of networked discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.025openalex-snapshot
On Verification of Strong Periodic D-Detectability for Discrete Event Systems
inferred← citeshttps://doi.org/10.1016/j.ins.2021.04.072openalex-snapshot
Networked opacity for finite state machine with bounded communication delays
inferred← citeshttps://doi.org/10.1016/j.ins.2025.122701openalex-snapshot
Language-based opacity in modular discrete event systems: Compositional secret-based verification using labeled petri nets
inferred← citeshttps://doi.org/10.1016/j.jcmds.2021.100021openalex-snapshot
A parallel algorithm for understanding design spaces and performing convex hull computations
inferred← citeshttps://doi.org/10.1038/s41598-022-25697-yopenalex-snapshot
Current-state opacity verification in discrete event systems using an observer net
inferred← citeshttps://doi.org/10.1080/00207179.2021.1951357openalex-snapshot
Current-state opacity and initial-state opacity of modular discrete event systems
inferred← citeshttps://doi.org/10.1109/access.2022.3213697openalex-snapshot
Stochastic Timed Discrete-Event Systems: Modular Modeling and Performance Evaluation Through Markovian Jumps
inferred← citeshttps://doi.org/10.1109/access.2025.3554636openalex-snapshot
Opacity Verification for a Class of Modular Discrete Event Systems
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683017openalex-snapshot
Local Opacity Verification for Distributed Discrete Event Systems
inferred← citeshttps://doi.org/10.1109/coase.2019.8843286openalex-snapshot
Supervisory Control for Delayed Detectability of Discrete Event Systems
inferred← citeshttps://doi.org/10.1109/iros55552.2023.10341877openalex-snapshot
Sensor Selection for Fine-Grained Behavior Verification that Respects Privacy
inferred← citeshttps://doi.org/10.1109/iros55552.2023.10342376openalex-snapshot
Sensor Selection for Fine-Grained Behavior Verification that Respects Privacy
inferred← citeshttps://doi.org/10.1109/lcsys.2022.3176531openalex-snapshot
State-Labeled Safety Analysis of Modular Observers for Opacity Verification
inferred← citeshttps://doi.org/10.1109/tac.2019.2897553openalex-snapshot
Opacity Enforcement Using Nondeterministic Publicly Known Edit Functions
inferred← citeshttps://doi.org/10.1109/tac.2019.2912484openalex-snapshot
Critical Observability for Automata and Petri Nets
inferred← citeshttps://doi.org/10.1109/tac.2019.2946165openalex-snapshot
Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement
inferred← citeshttps://doi.org/10.1109/tac.2021.3069899openalex-snapshot
Observer Construction for Polynomially Ambiguous Max-Plus Automata
inferred← citeshttps://doi.org/10.1109/tac.2026.3695799openalex-snapshot
Local Verification of Current-State Opacity and Static-State Opacity in Distributed Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/tase.2020.3001356openalex-snapshot
Detectability of Discrete-Event Systems Under Nondeterministic Observations
inferred← citeshttps://doi.org/10.1109/tase.2023.3265846openalex-snapshot
State Estimation and Detectability of Networked Discrete Event Systems With Multi-Channel Communication Networks
inferred← citeshttps://doi.org/10.1109/wodes69290.2026.11598042openalex-snapshot
Weak Prognosability of Discrete Event Systems
inferred← citeshttps://doi.org/10.1561/2600000024openalex-snapshot
Analysis and Control for Resilience of Discrete Event Systems
inferred← citeshttps://doi.org/10.2139/ssrn.5671231openalex-snapshot
Security and Timing Analysis in Discrete-Event Systems: From Verification to Synthesis
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:14)2021openalex-snapshot
Partially Ordered Automata and Piecewise Testability
inferred← citeshttps://doi.org/10.23919/acc45564.2020.9148014openalex-snapshot
Note that each information-Supervisory Control of Discrete-Event Systems for Infinite-Step Opacity
inferred← citeshttps://doi.org/10.23919/ccc52363.2021.9550709openalex-snapshot
Algebraic analysis and control of networked opacity with bounded communication delays
inferred← citeshttps://doi.org/10.48550/arxiv.1903.11413openalex-snapshot
Estimation and Verification of Partially-Observed Discrete-Event Systems
showing the first 40 of 41 · page through all 41
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.