On the public citation graph
Comments on “A new approach for the verification of infinite-step and K -step opacity using two-way observers” [Automatica 80 (2017) 162–171]
0 signed · 15 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/j.automatica.2017.02.037openalex-snapshot
A new approach for the verification of infinite-step and K -step opacity using two-way observers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asjc.2956openalex-snapshot
Opacity of discrete‐event systems under nondeterministic observation mechanism
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.1016/j.automatica.2020.109273openalex-snapshot
Authors’ Reply to “Comments on “A new approach for the verification of infinite-step and K-step opacity using two-way observers” [Automatica, 2017(80)162-171]”
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110221openalex-snapshot
Verification of K -step and infinite-step opacity of bounded labeled Petri nets
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110756openalex-snapshot
Strong current-state and initial-state opacity of discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111153openalex-snapshot
Verifying weak and strong k-step opacity in discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.112085openalex-snapshot
Always guarding you: Strong initial-and-final-state opacity of discrete-event systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.10.331openalex-snapshot
On Verification of Weak and Strong k-step Opacity for Discrete-Event Systems*
inferred← citeshttps://doi.org/10.1016/j.ress.2025.112093openalex-snapshot
Robust opacity in timed automata: notions and verification
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/cdc51059.2022.9993023openalex-snapshot
Verification of Strong K-Step Opacity for Discrete-Event Systems
inferred← citeshttps://doi.org/10.1109/tase.2025.3614662openalex-snapshot
Online Opacity Verification of Networked Discrete Event Systems Modeled With Labeled Petri Nets
inferred← citeshttps://doi.org/10.1109/tsmc.2024.3441730openalex-snapshot
Three New Versions of Strong Opacity Based on the Security Quantification Consideration
inferred← citeshttps://doi.org/10.48550/arxiv.2109.02158openalex-snapshot
K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations
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.