On the public citation graph
Deciding detectability for labeled Petri nets
0 signed · 54 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.1016/0378-4754(82)90066-0openalex-snapshot
Petri Net theory and the modeling of systems
inferredcites →https://doi.org/10.1016/0890-5401(92)90059-oopenalex-snapshot
A unified approach for deciding the existence of certain petri net paths
inferredcites →https://doi.org/10.1016/j.automatica.2017.01.013openalex-snapshot
Decidability of opacity verification problems in labeled Petri net 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.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.2019.02.058openalex-snapshot
Deciding detectability for labeled Petri nets
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.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/tac.2007.910713openalex-snapshot
Detectability of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2012.2200372openalex-snapshot
A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
inferredcites →https://doi.org/10.1109/tac.2012.2224255openalex-snapshot
Delayed Detectability of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2017.2699278openalex-snapshot
On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
inferredcites →https://doi.org/10.1109/tac.2017.2756096openalex-snapshot
Verification of Prognosability for Labeled Petri Nets
inferredcites →https://doi.org/10.1142/s0129054111008428openalex-snapshot
ON YEN'S PATH LOGIC FOR PETRI NETS
inferredcites →https://doi.org/10.2307/2370405openalex-snapshot
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
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_10openalex-snapshot
Detectability of Labeled Petri Nets
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.1007/s12555-021-0215-9openalex-snapshot
Optimistic Fault Diagnosis in Discrete Event Systems by Labeled Petri Nets and Basis Markings
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.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.2024.111644openalex-snapshot
On the verification of detectability for timed discrete event systems
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.ins.2020.04.024openalex-snapshot
Verification of C-detectability using Petri nets
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121404openalex-snapshot
Path detectability verification for time-dependent systems with application to flexible manufacturing 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.1049/cth2.12546openalex-snapshot
A symbolic approach to the verification and enforcement of current‐state opacity using labelled Petri nets
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/jsen.2024.3457497openalex-snapshot
Strong Co-Detectability for Labeled Petri Nets and Its Enforcement via Additional Sensors
inferred← citeshttps://doi.org/10.1109/tac.2024.3510521openalex-snapshot
Minimum Initial Marking Estimation in Labeled Petri Nets Using Minimum Token Number Prediction
inferred← citeshttps://doi.org/10.1109/tac.2026.3653378openalex-snapshot
A Sequence-Based Approach for the Verification of Current-State Opacity in Bounded 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.2021.3133910openalex-snapshot
Crucial States Estimation in Radio Block Center Handover Using Petri Nets With Unobservable Transitions
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.2023.3265846openalex-snapshot
State Estimation and Detectability of Networked Discrete Event Systems With Multi-Channel Communication Networks
inferred← citeshttps://doi.org/10.1561/2600000028openalex-snapshot
A New Framework for Discrete-Event Systems
inferred← citeshttps://doi.org/10.23919/acc.2019.8814774openalex-snapshot
Verification of Detectability in Labeled Petri Nets
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867438openalex-snapshot
On the Verification of Detectability for Timed Systems
inferred← citeshttps://doi.org/10.23919/ccc63176.2024.10661440openalex-snapshot
Strong Co-Detectability for Labeled Petri Nets and its Enforcement via Additional Sensors
inferred← citeshttps://doi.org/10.3390/math13040563openalex-snapshot
Verification of Detectability for Time Labeled Petri Net Systems with Unobservable Transitions
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.2001.04729openalex-snapshot
A unified method to decentralized state inference and fault diagnosis/prediction of discrete-event systems
showing the first 33 of 34 · page through all 34
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.