On the public citation graph
An improved approach for verifying delayed detectability of discrete-event systems
0 signed · 44 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-030-25972-3_7openalex-snapshot
Observability of Nondeterministic Finite-Transition Systems
inferredcites →https://doi.org/10.1007/s10626-018-0268-yopenalex-snapshot
Detectability of networked discrete event systems
inferredcites →https://doi.org/10.1016/0020-0255(88)90001-1openalex-snapshot
On observability of discrete-event systems
inferredcites →https://doi.org/10.1016/j.automatica.2017.02.032openalex-snapshot
Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
inferredcites →https://doi.org/10.1016/j.automatica.2017.02.037openalex-snapshot
A new approach for the verification of infinite-step and K -step opacity using two-way observers
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.2017.08.027openalex-snapshot
Verification of detectability in Probabilistic Finite Automata
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.automatica.2019.02.058openalex-snapshot
Deciding detectability for labeled Petri nets
inferredcites →https://doi.org/10.1016/j.automatica.2019.03.003openalex-snapshot
State estimation of max-plus automata with unobservable events
inferredcites →https://doi.org/10.1016/j.ifacol.2017.08.909openalex-snapshot
Detectability of Nondeterministic Finite Transition Systems
inferredcites →https://doi.org/10.1016/j.ifacol.2018.06.296openalex-snapshot
Weak (approximate) detectability of labeled Petri net systems with inhibitor arcs
inferredcites →https://doi.org/10.1016/j.sysconle.2011.02.001openalex-snapshot
Generalized detectability for discrete event systems
inferredcites →https://doi.org/10.1016/j.sysconle.2018.07.008openalex-snapshot
Trajectory detectability of discrete-event systems
inferredcites →https://doi.org/10.1080/00207543.2017.1346835openalex-snapshot
State estimation of discrete event systems for RUL prediction issue
inferredcites →https://doi.org/10.1109/9.57018openalex-snapshot
Observability of discrete event dynamic systems
inferredcites →https://doi.org/10.1109/9.940942openalex-snapshot
A polynomial algorithm for testing diagnosability of discrete-event systems
inferredcites →https://doi.org/10.1109/cdc.1986.267551openalex-snapshot
Observability of discrete event systems
inferredcites →https://doi.org/10.1109/cdc.2016.7798305openalex-snapshot
K-detectability in discrete event systems
inferredcites →https://doi.org/10.1109/coase.2017.8256101openalex-snapshot
Matrix approach to detectability of discrete event systems under partial observation
inferredcites →https://doi.org/10.1109/tac.2002.802763openalex-snapshot
Polynomial-time verification of diagnosability of partially observed discrete-event systems
inferredcites →https://doi.org/10.1109/tac.2007.910713openalex-snapshot
Detectability of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2012.2224255openalex-snapshot
Delayed Detectability of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2013.2251796openalex-snapshot
Enforcing Detectability in Controlled Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2015.2484359openalex-snapshot
A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems
inferredcites →https://doi.org/10.1109/tac.2018.2843723openalex-snapshot
Detectability Measure for State Estimation of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2019.2907413openalex-snapshot
Marking Estimation in a Class of Time Labeled Petri Nets
inferredcites →https://doi.org/10.1109/tase.2012.2215959openalex-snapshot
I-Detectability of Discrete-Event Systems
inferredcites →https://doi.org/10.23919/acc.2019.8814302openalex-snapshot
State Estimation and Detectability of Networked Discrete Event Systems with Multi-Channel Communication Networks
inferredcites →https://doi.org/10.23919/acc.2019.8814774openalex-snapshot
Verification of Detectability in Labeled Petri Nets
inferredcites →https://doi.org/10.48550/arxiv.1910.13768openalex-snapshot
Revisiting delayed strong detectability of discrete-event systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2023.100902openalex-snapshot
A unified concurrent-composition method to state/event inference and concealment in labeled finite-state automata as discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120611openalex-snapshot
Information control in networked discrete event systems
inferred← citeshttps://doi.org/10.1016/j.nahs.2021.101087openalex-snapshot
Analysis of strong and strong periodic detectability of bounded labeled Petri nets
inferred← citeshttps://doi.org/10.1016/j.nahs.2026.101798openalex-snapshot
Detectability, opacity and declassification of timed DESs with release observation mechanism
inferred← citeshttps://doi.org/10.1049/cth2.12593openalex-snapshot
Silent closure based pair verifier for fault pattern diagnosis of discrete event systems
inferred← citeshttps://doi.org/10.1109/icmra59796.2023.10708371openalex-snapshot
Verification of Delayed Detectability for Unambiguous Weighted Automata
inferred← citeshttps://doi.org/10.1109/tac.2021.3140111openalex-snapshot
Polynomial-Time Verification and Enforcement of Delayed Strong Detectability for Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/tase.2022.3165382openalex-snapshot
Revisiting State Estimation and Weak Detectability of Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/tase.2026.3701324openalex-snapshot
Information Control in Networked Multi-User Discrete-Event Systems Using State Estimates
inferred← citeshttps://doi.org/10.1109/tcyb.2022.3165216openalex-snapshot
A State Space Approach to Decentralized Fault SE-Coprognosability of Partially Observed Discrete Event Systems
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867438openalex-snapshot
On the Verification of Detectability for Timed Systems
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.