On the public citation graph
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy
0 signed · 36 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/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferredcites →https://doi.org/10.1016/0304-3975(94)00228-bopenalex-snapshot
Reachability analysis of dynamical systems having piecewise-constant derivatives
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11867340_17openalex-snapshot
On the Computational Power of Timed Differentiable Petri Nets
inferred← citeshttps://doi.org/10.1007/11901914_18openalex-snapshot
Controller Synthesis and Ordinal Automata
inferred← citeshttps://doi.org/10.1007/3-540-46430-1_26openalex-snapshot
Decidability and Complexity Results for Timed Automata and Semi-linear 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-030-32409-4_15openalex-snapshot
Probably Approximate Safety Verification of Hybrid Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_5openalex-snapshot
Computation with Real Numbers and Continuous-Time Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_12openalex-snapshot
Weak Singular Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_35openalex-snapshot
Stochastic Local Search for Falsification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_25openalex-snapshot
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_9openalex-snapshot
Real Recursive Functions and Real Extensions of Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_4openalex-snapshot
The Discrete Time Behavior of Lazy Linear Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-11456-4_11openalex-snapshot
Computability and Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_16openalex-snapshot
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_2openalex-snapshot
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.070openalex-snapshot
How much can analog and hybrid systems be proved (super-)Turing
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.025openalex-snapshot
Computation with perturbed dynamical systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.010openalex-snapshot
Elementarily computable functions over the real numbers and R -sub-recursive functions
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80479-1openalex-snapshot
Classes of Timed Automata and the Undecidability of Universality
inferred← citeshttps://doi.org/10.1109/iccps61052.2024.00022openalex-snapshot
Robust Conformal Prediction for STL Runtime Verification under Distribution Shift
inferred← citeshttps://doi.org/10.1109/lics.2012.64openalex-snapshot
The Complete Proof Theory of Hybrid Systems
inferred← citeshttps://doi.org/10.1145/3358231openalex-snapshot
Specification Mining and Robust Design under Uncertainty
inferred← citeshttps://doi.org/10.1145/3748818openalex-snapshot
Distributionally Robust Predictive Runtime Verification under Spatio-Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1184/r1/6610451openalex-snapshot
The Complete Proof Theory of Hybrid Systems (CMU-CS-11-144)
inferred← citeshttps://doi.org/10.21236/ada561153openalex-snapshot
Differential Game Logic for Hybrid Games
inferred← citeshttps://doi.org/10.3233/fun-2008-821-212openalex-snapshot
Classes of Timed Automata and the Undecidability of Universality
inferred← citeshttps://doi.org/10.47749/t/unicamp.2003.293010openalex-snapshot
Grau de indecidibilidade da universidade para subclasses de automatos temporizados
inferred← citeshttps://doi.org/10.48550/arxiv.1205.4788openalex-snapshot
Dynamic Logics of Dynamical Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1503.04928openalex-snapshot
Hybrid Automata for Formal Modeling and Verification of Cyber-Physical 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.