On the public citation graph

Complexity of deciding detectability in discrete event systems

0 signed · 60 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/bf00299636openalex-snapshot
The method of forced enumeration for nondeterministic automata
inferredcites →https://doi.org/10.1016/0022-0000(80)90003-3openalex-snapshot
Languages of R-trivial monoids
inferredcites →https://doi.org/10.1016/0304-3975(91)90075-dopenalex-snapshot
Finite-automaton aperiodicity is PSPACE-complete
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.12.019openalex-snapshot
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
inferredcites →https://doi.org/10.1016/j.ic.2017.06.004openalex-snapshot
Complexity of universality and related problems for partially ordered NFAs
inferredcites →https://doi.org/10.1016/j.sysconle.2011.02.001openalex-snapshot
Generalized detectability for discrete event systems
inferredcites →https://doi.org/10.1109/9.57018openalex-snapshot
Observability of discrete event dynamic systems
inferredcites →https://doi.org/10.1109/cdc.1986.267551openalex-snapshot
Observability of discrete event systems
inferredcites →https://doi.org/10.1109/cdc.1988.194300openalex-snapshot
Dynamical logic observers for finite automata
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof 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.2017.2726582openalex-snapshot
Complexity of Verifying Nonblockingness in Modular Supervisory Control
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation

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/978-3-030-25972-3_9openalex-snapshot
Detectability of Finite-State Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-30821-6_6openalex-snapshot
Detectability
inferred← citeshttps://doi.org/10.1007/s10626-020-00311-3openalex-snapshot
On detectability of labeled Petri nets and finite automata
inferred← citeshttps://doi.org/10.1007/s10626-022-00362-8openalex-snapshot
Detectability of labeled weighted automata over monoids
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.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.automatica.2018.12.019openalex-snapshot
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.02.058openalex-snapshot
Deciding detectability for labeled Petri nets
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.109884openalex-snapshot
On verification of D-detectability for discrete event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111644openalex-snapshot
On the verification of detectability for timed discrete event systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.06.296openalex-snapshot
Weak (approximate) detectability of labeled Petri net systems with inhibitor arcs
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.2537openalex-snapshot
Instant detectability of discrete-event 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.ifacol.2022.10.353openalex-snapshot
Eventual strong detectability of labeled weighted automata over monoids
inferred← citeshttps://doi.org/10.1016/j.ins.2020.04.024openalex-snapshot
Verification of C-detectability using Petri nets
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2019.05.028openalex-snapshot
Matrix approach to detectability of 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.sysconle.2018.07.008openalex-snapshot
Trajectory detectability of discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116259openalex-snapshot
Weakly acyclic automata and exponential time hypotheses: Universality and related problems
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/codit58514.2023.10284082openalex-snapshot
Verification of Detectability for Unambiguous Weighted Automata Using Self-Composition
inferred← citeshttps://doi.org/10.1109/icmra59796.2023.10708371openalex-snapshot
Verification of Delayed Detectability for Unambiguous Weighted Automata
inferred← citeshttps://doi.org/10.1109/lcsys.2023.3273472openalex-snapshot
Removing Two Fundamental Assumptions in Verifying Strong Periodic (D-)Detectability of Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/tac.2019.2912484openalex-snapshot
Critical Observability for Automata and Petri Nets
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.2021.3140111openalex-snapshot
Polynomial-Time Verification and Enforcement of Delayed Strong Detectability for Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/tac.2022.3225514openalex-snapshot
On Detectability of a Class of Hybrid 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.2022.3165382openalex-snapshot
Revisiting State Estimation and Weak Detectability of Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/wodes69290.2026.11598163openalex-snapshot
Loss-Tolerant Detectability for Ciphered Discrete Event Systems
inferred← citeshttps://doi.org/10.1561/2600000028openalex-snapshot
A New Framework for Discrete-Event Systems
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:14)2021openalex-snapshot
Partially Ordered Automata and Piecewise Testability
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867776openalex-snapshot
How attacks affect detectability in discrete-event systems?
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00261openalex-snapshot
Critical Observability for Automata and Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1903.09298openalex-snapshot
Verification of Detectability in Petri Nets Using Verifier Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1903.11413openalex-snapshot
Estimation and Verification of Partially-Observed Discrete-Event Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1908.09604openalex-snapshot
Verification of Detectability Using Petri Nets and Detector
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13768openalex-snapshot
Revisiting delayed strong detectability of discrete-event systems
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04729openalex-snapshot
A unified method to decentralized state inference and fault diagnosis/prediction of discrete-event systems
inferred← citeshttps://doi.org/10.48550/arxiv.2109.08854openalex-snapshot
New methods for verifying strong periodic detectability and strong periodic D-detectability of discrete-event systems
inferred← citeshttps://doi.org/10.48550/arxiv.2111.02824openalex-snapshot
A unified concurrent-composition method to state/event inference and concealment in discrete-event 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.