On the public citation graph
Dynamical properties of timed automata
0 signed · 57 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.1006/inco.1995.1059openalex-snapshot
Timing Verification by Successive Approximation
inferredcites →https://doi.org/10.1007/3-540-52148-8_17openalex-snapshot
Timing assumptions and verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1007/3-540-56922-7_18openalex-snapshot
An efficient algorithm for minimizing real-time transition systems
inferredcites →https://doi.org/10.1007/3-540-63166-6_48openalex-snapshot
HyTech: A model checker for hybrid systems
inferredcites →https://doi.org/10.1007/bf00709157openalex-snapshot
Minimum and maximum delay problems in real-time systems
inferredcites →https://doi.org/10.1007/bfb0020949openalex-snapshot
UPPAAL — a tool suite for automatic verification of real-time systems
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1007/bfb0055349openalex-snapshot
Dynamical properties of timed automata
inferredcites →https://doi.org/10.1016/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferredcites →https://doi.org/10.1016/0895-7177(96)00072-6openalex-snapshot
Decidable hybrid systems
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6044-1openalex-snapshot
Differential Equations, Dynamical Systems, and Linear Algebra
inferredcites →https://doi.org/10.1023/a:1008621829508openalex-snapshot
An Efficient Algorithm for Minimizing Real-Time Transition Systems
inferredcites →https://doi.org/10.1109/lics.1992.185551openalex-snapshot
Symbolic model checking for real-time systems
inferredcites →https://doi.org/10.1145/225058.225162openalex-snapshot
What's decidable about hybrid automata?
inferredcites →https://doi.org/10.7146/brics.v3i58.18769openalex-snapshot
UPPAAL—a Tool Suite for Automatic Verification of Real–Time 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/11560647_17openalex-snapshot
A Robust Interpretation of Duration Calculus
inferred← citeshttps://doi.org/10.1007/11603009_18openalex-snapshot
Quantifying Similarities Between Timed Systems
inferred← citeshttps://doi.org/10.1007/11682462_25openalex-snapshot
Robust Model-Checking of Linear-Time Properties in Timed Automata
inferred← citeshttps://doi.org/10.1007/11867340_11openalex-snapshot
Symbolic Robustness Analysis of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_17openalex-snapshot
What Will Be Eventually True of Polynomial Hybrid Automata?
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot
A Survey on Continuous Time Computations
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_1openalex-snapshot
Robust Structural Transformations for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_29openalex-snapshot
Model Checking Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_30openalex-snapshot
Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-57288-8_4openalex-snapshot
Multi-timed Bisimulation for Distributed Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_1openalex-snapshot
Decision Problems for Timed Automata: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_10openalex-snapshot
Robustness and Implementability of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_30openalex-snapshot
Timed Concurrent Game Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_11openalex-snapshot
Dynamical Properties of Timed Automata Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_15openalex-snapshot
Probabilistic and Topological Semantics for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_12openalex-snapshot
Robust Analysis of Timed Automata Via Channel Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_9openalex-snapshot
Reachability in Stochastic Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_19openalex-snapshot
Robust Computations with Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_23openalex-snapshot
Distributed Event Clock Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_10openalex-snapshot
Robust Specification of Real Time Components
inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_1openalex-snapshot
Robustness in Timed Automata
inferred← citeshttps://doi.org/10.1007/s10703-008-0056-7openalex-snapshot
Robust safety of timed automata
inferred← citeshttps://doi.org/10.1016/j.cosrev.2013.05.001openalex-snapshot
A survey of timed automata for the development of real-time systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.027openalex-snapshot
Closed, Open, and Robust Timed Networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.042openalex-snapshot
A temporal logic for micro- and macro-step-based real-time systems: Foundations and applications
inferred← citeshttps://doi.org/10.1023/a:1008387132377openalex-snapshot
Dynamical Properties of Timed Automata
inferred← citeshttps://doi.org/10.1109/lics.2003.1210059openalex-snapshot
Revisiting digitization, robustness, and decidability for timed automata
inferred← citeshttps://doi.org/10.1109/sies.2011.5953652openalex-snapshot
Robustness in real-time systems
inferred← citeshttps://doi.org/10.1109/time.2016.20openalex-snapshot
Combining Free Choice and Time in Petri Nets
inferred← citeshttps://doi.org/10.1145/3597209openalex-snapshot
Model-Based Diagnosis of Real-Time Systems: Robustness Against Varying Latency, Clock Drift, and Out-of-Order Observations
inferred← citeshttps://doi.org/10.1504/ijcnds.2016.080588openalex-snapshot
Relative time rates in dynamic timed automata
inferred← citeshttps://doi.org/10.2168/lmcs-6(1:1)2010openalex-snapshot
O-Minimal Hybrid Reachability Games
inferred← citeshttps://doi.org/10.25100/iyc.v15i2.2599openalex-snapshot
Modelamiento y especificación de sistemas distribuidos y temporizados
inferred← citeshttps://doi.org/10.3233/fi-2016-1312openalex-snapshot
Robustness of Time Petri Nets under Guard Enlargement
inferred← citeshttps://doi.org/10.4204/eptcs.87.3openalex-snapshot
A Parametric Counterexample Refinement Approach for Robust Timed Specifications
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:20)2023openalex-snapshot
Optimal controller synthesis for timed systems
showing the first 38 of 39 · page through all 39
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.