On the public citation graph
Accepting Zeno words without making time stand still
0 signed · 27 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.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1007/3-540-55179-4_37openalex-snapshot
Minimum and maximum delay problems in realtime systems
inferredcites →https://doi.org/10.1007/3-540-60922-9_22openalex-snapshot
On the power of non-observable actions in timed automata
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/bf00709157openalex-snapshot
Minimum and maximum delay problems in real-time systems
inferredcites →https://doi.org/10.1007/bfb0023491openalex-snapshot
Removing ε-transitions in timed automata
inferredcites →https://doi.org/10.1007/bfb0029958openalex-snapshot
Accepting Zeno words without making time stand still
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1016/0020-0190(95)00077-popenalex-snapshot
Untiming timed languages
inferredcites →https://doi.org/10.1016/0022-0000(78)90036-3openalex-snapshot
Finite automata, definable sets, and regular expressions over ωn-tapes
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/0304-3975(95)00006-2openalex-snapshot
Finite automata and ordinals
inferredcites →https://doi.org/10.1142/s0218196798000028openalex-snapshot
Automata, Semigroups and Recognizability of Words on Ordinals
inferredcites →https://doi.org/10.1145/93385.93428openalex-snapshot
Using mappings to prove timing properties
inferredcites →https://doi.org/10.1145/99583.99629openalex-snapshot
Temporal proof methodologies for real-time systems
inferredcites →https://doi.org/10.3233/fi-1985-83-407openalex-snapshot
Finite Automata on Transfinite Sequences and Regular Expressions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11505877_14openalex-snapshot
A Kleene Theorem for Languages of Words Indexed by Linear Orderings
inferred← citeshttps://doi.org/10.1007/11562948_20openalex-snapshot
Reasoning About Transfinite Sequences
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_21openalex-snapshot
Automata on Linear Orderings
inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_32openalex-snapshot
On Transfinite Hybrid Automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.009openalex-snapshot
Automata on linear orderings
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00286-8openalex-snapshot
Locally finite languages
inferred← citeshttps://doi.org/10.1142/s0129054106003978openalex-snapshot
A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
showing the first 9 of 10 · page through all 10
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.