On the public citation graph
Initial-state detectability and initial-state opacity of unambiguous weighted automata
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-642-01492-5openalex-snapshot
Handbook of Weighted Automata
inferredcites →https://doi.org/10.1007/s10626-012-0145-zopenalex-snapshot
Comparative analysis of related notions of opacity in centralized and coordinated architectures
inferredcites →https://doi.org/10.1007/s10626-014-0186-6openalex-snapshot
Compositions of (max, +) automata
inferredcites →https://doi.org/10.1007/s10626-015-0214-1openalex-snapshot
Determinization of timed Petri nets behaviors
inferredcites →https://doi.org/10.1007/s10626-018-0268-yopenalex-snapshot
Detectability of networked discrete event systems
inferredcites →https://doi.org/10.1007/s10626-019-00296-8openalex-snapshot
Leveraging Horn clause solving for compositional verification of PLC software
inferredcites →https://doi.org/10.1007/s10626-019-00309-6openalex-snapshot
A contribution to the determinization of max-plus automata
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.08.027openalex-snapshot
Verification of detectability in Probabilistic Finite Automata
inferredcites →https://doi.org/10.1016/j.automatica.2018.10.049openalex-snapshot
Infinite-step opacity and K -step opacity of stochastic 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.automatica.2019.06.028openalex-snapshot
Enforcing opacity by insertion functions under multiple energy constraints
inferredcites →https://doi.org/10.1016/j.entcs.2004.10.010openalex-snapshot
Modelling Opacity Using Petri Nets
inferredcites →https://doi.org/10.1016/j.ifacol.2021.04.049openalex-snapshot
Behaviour Equivalent Max-Plus Automata for a Class of Timed Petri Nets
inferredcites →https://doi.org/10.1016/j.ins.2013.05.033openalex-snapshot
Verification of initial-state opacity in security applications of 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.1051/ita:2008017openalex-snapshot
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
inferredcites →https://doi.org/10.1109/9.412626openalex-snapshot
Diagnosability of discrete-event systems
inferredcites →https://doi.org/10.1109/9.478227openalex-snapshot
Performance evaluation of (max,+) automata
inferredcites →https://doi.org/10.1109/9.754807openalex-snapshot
Modeling and analysis of timed Petri nets using heaps of pieces
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/tac.2012.2224255openalex-snapshot
Delayed Detectability of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2019.2908726openalex-snapshot
Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach
inferredcites →https://doi.org/10.1109/tac.2020.2995173openalex-snapshot
Verification of Detectability for Unambiguous Weighted Automata
inferredcites →https://doi.org/10.1109/tase.2012.2215959openalex-snapshot
I-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.1007/s11432-023-4041-6openalex-snapshot
Multi-step state-based opacity for unambiguous weighted machines
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111330openalex-snapshot
Sensor deception attacks against security in supervisory control systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.10.335openalex-snapshot
You Don't Know What I Know: On Notion of High-Order Opacity in Discrete-Event Systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.10.356openalex-snapshot
Weight-deterministic max-plus automata
inferred← citeshttps://doi.org/10.1016/j.isatra.2024.03.019openalex-snapshot
Verification of initial-and-final-state opacity for unambiguous weighted automata
inferred← citeshttps://doi.org/10.1016/j.nahs.2025.101633openalex-snapshot
Timed initial-state detectability of discrete-event systems by algebraic method
inferred← citeshttps://doi.org/10.1108/ec-07-2024-0624openalex-snapshot
Engineering efficiency unleashed: minimum initial marking estimation in labeled Petri nets through a cutting-edge hybrid evolutionary heuristic
inferred← citeshttps://doi.org/10.1109/access.2024.3413070openalex-snapshot
Online Verification and Enforcement of Sequential K-Opacity in Extended Probabilistic Automata
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/tac.2020.2995173openalex-snapshot
Verification of Detectability for Unambiguous Weighted Automata
inferred← citeshttps://doi.org/10.1109/tsmc.2022.3176045openalex-snapshot
Diagnosability of Unambiguous Max-Plus Automata
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.1109/yac59482.2023.10401732openalex-snapshot
Verification of D-detectability for Unambiguous Weighted Automata
inferred← citeshttps://doi.org/10.3390/math11244991openalex-snapshot
Verification and Enforcement of (ϵ, ξ)-Differential Privacy over Finite Steps 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.