On the public citation graph

From finite automata toward hybrid systems (Extended abstract)

https://doi.org/10.1007/bfb0036202
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.
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.1007/3-540-57318-6_30openalex-snapshot
Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
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/3-540-59042-0_76openalex-snapshot
On the synthesis of discrete controllers for timed systems
inferredcites →https://doi.org/10.1007/bf02478259openalex-snapshot
A logical calculus of the ideas immanent in nervous activity
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/s0022-0000(67)80014-xopenalex-snapshot
Some definitional suggestions for automata theory
inferredcites →https://doi.org/10.1109/32.489079openalex-snapshot
Automatic symbolic verification of embedded systems
inferredcites →https://doi.org/10.1109/lics.1995.523284openalex-snapshot
Origins and metamorphoses of the Trinity: logic, nets, automata
inferredcites →https://doi.org/10.1109/lics.1996.561342openalex-snapshot
The theory of hybrid automata
inferredcites →https://doi.org/10.1109/real.1993.393520openalex-snapshot
Automatic symbolic verification of embedded systems
inferredcites →https://doi.org/10.1145/186025.186058openalex-snapshot
An old-fashioned recipe for real time
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.2307/2003489openalex-snapshot
Introduction to the Theory of Finite 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/11874683_36openalex-snapshot
Church Synthesis Problem with Parameters
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_2openalex-snapshot
Automata, Circuits, and Hybrids: Facets of Continuous Time
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_4openalex-snapshot
Automata and their interaction: Definitional suggestions
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-59234-9_6openalex-snapshot
A Survey on Analog Models of Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_1openalex-snapshot
From Logic to Theoretical Computer Science – An Update
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_3openalex-snapshot
Boris A. Trakhtenbrot: Academic Genealogy and Publications
inferred← citeshttps://doi.org/10.1007/bfb0055642openalex-snapshot
On discretization of delays in timed automata and digital circuits
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.007openalex-snapshot
Automata and logics over finitely varying functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.018openalex-snapshot
Computability of analog networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00126-8openalex-snapshot
Finite variability interpretation of monadic logic of order
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00331-6openalex-snapshot
Automata over continuous time
inferred← citeshttps://doi.org/10.1145/380752.380884openalex-snapshot
Automata, circuits and hybrids
inferred← citeshttps://doi.org/10.1145/506147.506151openalex-snapshot
Timed regular expressions
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.