On the public citation graph

Controlled timed automata

https://doi.org/10.1007/bfb0055641
0 signed · 35 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.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferredcites →https://doi.org/10.1007/3-540-58179-0_39openalex-snapshot
A determinizable class of timed automata
inferredcites →https://doi.org/10.1007/3-540-58468-4_191openalex-snapshot
Specifying timed state sequences in powerful decidable logics and timed automata
inferredcites →https://doi.org/10.1007/bfb0014736openalex-snapshot
Robust timed automata
inferredcites →https://doi.org/10.1007/bfb0023491openalex-snapshot
Removing ε-transitions in timed automata
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/s0020-0190(97)00217-2openalex-snapshot
Timed automata and recognizability
inferredcites →https://doi.org/10.1109/lics.1996.561342openalex-snapshot
The theory of hybrid automata
inferredcites →https://doi.org/10.1109/sfcs.1992.267774openalex-snapshot
Back to the future: towards a theory of timed regular languages
inferredcites →https://doi.org/10.25596/jalc-2000-371openalex-snapshot
Timed Automata with Periodic Clock Constraints

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36494-3_54openalex-snapshot
Untameable Timed Automata!
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_19openalex-snapshot
Expressiveness of Updatable Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_17openalex-snapshot
An Algebraic Characterization of Data and Timed Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-31220-0_11openalex-snapshot
On Reachability Analysis of Updatable Timed Automata with One Updatable Clock
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_44openalex-snapshot
Updatable Timed Automata with Additive and Diagonal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_15openalex-snapshot
Interrupt Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-05031-2_1openalex-snapshot
Testing Real-Time Systems Using TINA
inferred← citeshttps://doi.org/10.1007/s00224-010-9253-zopenalex-snapshot
Model Checking Weighted Integer Reset Timed Automata
inferred← citeshttps://doi.org/10.1007/s00236-003-0135-6openalex-snapshot
Timed automata with urgent transitions
inferred← citeshttps://doi.org/10.1007/s00446-011-0148-2openalex-snapshot
A study on shuffle, stopwatches and independently evolving clocks
inferred← citeshttps://doi.org/10.1007/s10703-011-0140-2openalex-snapshot
Interrupt Timed Automata: verification and expressiveness
inferred← citeshttps://doi.org/10.1007/s11432-016-9027-yopenalex-snapshot
Updatable timed automata with one updatable clock
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.tcs.2004.04.003openalex-snapshot
Updatable timed automata
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00075-2openalex-snapshot
Timed automata and additive clock constraints
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00229-6openalex-snapshot
A logical characterization of data languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00894-0openalex-snapshot
Categorical foundations for randomly timed automata
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00038-5openalex-snapshot
An algebraic approach to data languages and timed languages
inferred← citeshttps://doi.org/10.1023/b:form.0000026093.21513.31openalex-snapshot
Forward Analysis of Updatable Timed Automata
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493609openalex-snapshot
Test of preemptive real-time systems
inferred← citeshttps://doi.org/10.25596/jalc-2002-167openalex-snapshot
A Kleene/Büchi-Like Theorem for Clock Languages
inferred← citeshttps://doi.org/10.25596/jalc-2005-393openalex-snapshot
On Conciseness of Extensions of Timed Automata
inferred← citeshttps://doi.org/10.32657/10356/69560openalex-snapshot
Time optimal supervisory control of discrete event systems
inferred← citeshttps://doi.org/10.7146/brics.v9i35.21750openalex-snapshot
Timed Automata May Cause Some Troubles
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.