On the public citation graph

Pumping Lemmas for timed automata

https://doi.org/10.1007/bfb0053543
0 signed · 17 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.1006/inco.1996.0086openalex-snapshot
Parametric Timing Analysis for Real-Time Systems
inferredcites →https://doi.org/10.1007/bfb0014712openalex-snapshot
From quantity to quality
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1109/lics.1997.614944openalex-snapshot
A Kleene theorem for timed automata

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_24openalex-snapshot
On Timed Automata with Discrete Time – Structural and Language Theoretical Characterization
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-29662-9_11openalex-snapshot
The Timestamp of Timed Automata
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-540-40903-8_14openalex-snapshot
A Nonarchimedian Discretization for Timed Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_9openalex-snapshot
Thin and Thick Timed Regular Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.003openalex-snapshot
Entropy of regular timed languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00186-4openalex-snapshot
Decidable verification for reducible timed automata specified in a first order logic with time
inferred← citeshttps://doi.org/10.1051/ita/2010006openalex-snapshot
Formal language properties of hybrid systems with strong resets
inferred← citeshttps://doi.org/10.3233/fi-1998-36233openalex-snapshot
Characterization of the Expressive Power of Silent Transitions in Timed Automata
inferred← citeshttps://doi.org/10.3233/fi-2014-1021openalex-snapshot
A Nonarchimedian Discretization for Timed Languages
inferred← citeshttps://doi.org/10.70675/7583e15fz7b20z4b4eza7bcze3449157b227openalex-snapshot
Volumetry of timed languages and applications
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.