On the public citation graph

State estimation of max-plus automata with unobservable events

0 signed · 59 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/3-540-45739-9_14openalex-snapshot
Fault Diagnosis for Timed Automata
inferredcites →https://doi.org/10.1007/978-3-642-21834-7_3openalex-snapshot
State Estimation and Fault Detection Using Petri Nets
inferredcites →https://doi.org/10.1007/s10626-005-5239-4openalex-snapshot
State Estimation of ?-free Labeled Petri Nets with Contact-Free Nondeterministic Transitions*
inferredcites →https://doi.org/10.1007/s10626-014-0186-6openalex-snapshot
Compositions of (max, +) automata
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/j.arcontrol.2018.04.004openalex-snapshot
Max-plus algebra in the history of discrete event systems
inferredcites →https://doi.org/10.1016/j.automatica.2008.05.025openalex-snapshot
State estimation and detectability of probabilistic 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.08.027openalex-snapshot
Verification of detectability in Probabilistic Finite Automata
inferredcites →https://doi.org/10.1016/j.conengprac.2010.12.010openalex-snapshot
Discrete event diagnosis using labeled Petri nets. An application to manufacturing systems
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.57018openalex-snapshot
Observability of discrete event dynamic systems
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/cdc.1986.267551openalex-snapshot
Observability of discrete event systems
inferredcites →https://doi.org/10.1109/tac.2002.802769openalex-snapshot
Observability of place/transition nets
inferredcites →https://doi.org/10.1109/tac.2003.814099openalex-snapshot
Fault diagnosis in discrete-event systems: Framework and model reduction
inferredcites →https://doi.org/10.1109/tac.2007.904281openalex-snapshot
Marking Estimation of Petri Nets With Silent Transitions
inferredcites →https://doi.org/10.1109/tac.2007.910713openalex-snapshot
Detectability of Discrete Event Systems
inferredcites →https://doi.org/10.1109/tac.2009.2037477openalex-snapshot
Observer Design for $(\max, +)$ Linear Systems
inferredcites →https://doi.org/10.1109/tac.2014.2363916openalex-snapshot
State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions
inferredcites →https://doi.org/10.1109/tase.2013.2290314openalex-snapshot
State Estimation of Timed Labeled Petri Nets With Unobservable Transitions
inferredcites →https://doi.org/10.1109/tsmc.1976.4309444openalex-snapshot
Towards an Abstract Internal Model Principle
inferredcites →https://doi.org/10.1109/tsmc.2014.2353575openalex-snapshot
Marking Estimation of P-Time Petri Nets With Unobservable Transitions
inferredcites →https://doi.org/10.3182/20110828-6-it-1002.01523openalex-snapshot
On State Estimation of Timed Choice-Free Petri Nets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rnc.5459openalex-snapshot
Relatively maximal perturbation bounds for global robustness of max‐plus linear systems
inferred← citeshttps://doi.org/10.1007/978-3-030-92511-6_14openalex-snapshot
Modeling and Cycle Analysis of Traffic Signal Systems Based on Timed Networks
inferred← citeshttps://doi.org/10.1007/978-981-96-0617-7_6openalex-snapshot
Efficient State Estimation of Discrete-Timed Automata
inferred← citeshttps://doi.org/10.1007/s00500-023-08030-1openalex-snapshot
Intermittent fault manifestability of discrete event systems
inferred← citeshttps://doi.org/10.1007/s10626-021-00348-yopenalex-snapshot
Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection
inferred← citeshttps://doi.org/10.1007/s10626-021-00352-2openalex-snapshot
Local and global robustness with q-step delay for max-plus linear systems
inferred← citeshttps://doi.org/10.1007/s10626-022-00362-8openalex-snapshot
Detectability of labeled weighted automata over monoids
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.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.automatica.2024.111874openalex-snapshot
State estimation for constant-time labeled automata under dense time
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.005openalex-snapshot
Global Robustness with q-Step Delay for Max-Plus Linear 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.ifacol.2024.07.042openalex-snapshot
Observer Design for Timed Automata under No Observation
inferred← citeshttps://doi.org/10.1016/j.nahs.2026.101794openalex-snapshot
Observer design and opacity verification for a class of timed automata
inferred← citeshttps://doi.org/10.1049/cth2.12752openalex-snapshot
State geometric adjustability for interval max‐plus linear systems
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683601openalex-snapshot
State Estimation of Discrete-Event Systems Subject to Intermittent and Permanent Loss of Observations
inferred← citeshttps://doi.org/10.1109/codit.2019.8820433openalex-snapshot
A Two-Step Approach for Fault Diagnosis of Max-Plus 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/tac.2020.2995173openalex-snapshot
Verification of Detectability for Unambiguous Weighted Automata
inferred← citeshttps://doi.org/10.1109/tac.2021.3064542openalex-snapshot
Observers for a Class of Timed Automata Based on Elapsed Time Graphs
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.2024.3432788openalex-snapshot
Verification of State-Based Timed Opacity for Constant-Time Labeled Automata
inferred← citeshttps://doi.org/10.1109/tac.2024.3492955openalex-snapshot
State Estimation of Timed Automata Under Partial Observation
inferred← citeshttps://doi.org/10.1109/tac.2025.3565213openalex-snapshot
Global and Local Error-Tolerant Decentralized State Estimation Under Partially Ordered Observations
inferred← citeshttps://doi.org/10.1109/tsmc.2024.3357742openalex-snapshot
Minimum Initial Marking Estimation in Labeled Petri Nets With Unobservable Transitions Based on Minimal Explanations
inferred← citeshttps://doi.org/10.1109/yac59482.2023.10401732openalex-snapshot
Verification of D-detectability for Unambiguous Weighted Automata
inferred← citeshttps://doi.org/10.1177/09596518251334860openalex-snapshot
A simulated annealing method for minimum initial marking estimation in labeled Petri nets: Applications and comparative studies
inferred← citeshttps://doi.org/10.2139/ssrn.5671231openalex-snapshot
Security and Timing Analysis in Discrete-Event Systems: From Verification to Synthesis
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867438openalex-snapshot
On the Verification of Detectability for Timed Systems
inferred← citeshttps://doi.org/10.26599/tst.2025.9010007openalex-snapshot
Length-Bounded Least-Cost Transition Firing Sequence Estimation in Petri Nets with Unobservable Transitions
inferred← citeshttps://doi.org/10.70675/2a3b61eaz6bccz40abza383z30466768ef68openalex-snapshot
Modélisation et Évaluation Analytique du Temps de Réponse des Systèmes de Contrôle-Commande Distribués en utilisant des Réseaux de Petri et l'Algèbre des Dioïdes
inferred← citeshttps://doi.org/10.70675/51b2227dz5ba0z4b41z9a27z73c5a1cf2910openalex-snapshot
Etude des systèmes de transport public et réseaux logistiques par les réseaux de Petri colorés et l'algèbre (max, +) : modélisation, évaluation de performances et optimisation
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.