On the public citation graph
Undecidable Problems About Timed Automata
0 signed · 56 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.1007/11523468_88openalex-snapshot
Decidability and Complexity Results for Timed Automata via Channel Machines
inferredcites →https://doi.org/10.1007/3-540-60084-1_93openalex-snapshot
The expressive power of clocks
inferredcites →https://doi.org/10.1007/978-3-540-30080-9_1openalex-snapshot
Decision Problems for Timed Automata: A Survey
inferredcites →https://doi.org/10.1007/978-3-540-40903-8_15openalex-snapshot
Folk Theorems on the Determinization and Minimization of Timed Automata
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1051/ita:2003013openalex-snapshot
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/lics.2004.1319600openalex-snapshot
On the language inclusion problem for timed automata: closing a decidability gap
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/978-3-030-00151-3_13openalex-snapshot
Online Timed Pattern Matching Using Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-03769-7_12openalex-snapshot
Efficient Timed Diagnosis Using Automata with Timed Domains
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-76384-8_23openalex-snapshot
Quasi-Equal Clock Reduction On-the-Fly
inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_19openalex-snapshot
Bounded Determinization of Timed Automata with Silent Transitions
inferred← citeshttps://doi.org/10.1007/978-3-319-65765-3_2openalex-snapshot
On the Determinization of Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_10openalex-snapshot
Control Strategies for Off-Line Testing of Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_7openalex-snapshot
Timed Automata with Integer Resets: Language Inclusion and Expressiveness
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_62openalex-snapshot
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_4openalex-snapshot
When Are Timed Automata Determinizable?
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_17openalex-snapshot
A Game Approach to Determinize Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_10openalex-snapshot
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_12openalex-snapshot
A Machine-Independent Characterization of Timed Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_36openalex-snapshot
Reducing Clocks in Timed Automata while Preserving Bisimulation
inferred← citeshttps://doi.org/10.1007/s00236-015-0254-xopenalex-snapshot
Compositional schedulability analysis of real-time actor-based systems
inferred← citeshttps://doi.org/10.1007/s10009-021-00606-2openalex-snapshot
Diagnosing timed automata using timed markings
inferred← citeshttps://doi.org/10.1007/s10703-014-0220-1openalex-snapshot
A game approach to determinize timed automata
inferred← citeshttps://doi.org/10.1007/s10703-017-0271-1openalex-snapshot
Predictive runtime enforcement
inferred← citeshttps://doi.org/10.1007/s10703-022-00396-6openalex-snapshot
Equivalence checking and intersection of deterministic timed finite state machines
inferred← citeshttps://doi.org/10.1007/s10703-022-00403-wopenalex-snapshot
Control strategies for off-line testing of timed systems
inferred← citeshttps://doi.org/10.1007/s11241-017-9271-xopenalex-snapshot
Bounded determinization of timed automata with silent transitions
inferred← citeshttps://doi.org/10.1007/s11334-019-00357-zopenalex-snapshot
How to be sure a faulty system does not always appear healthy?
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.jss.2017.06.060openalex-snapshot
Predictive runtime verification of timed properties
inferred← citeshttps://doi.org/10.1051/ita/2009001openalex-snapshot
Highly Undecidable Problems For Infinite Computations
inferred← citeshttps://doi.org/10.1051/ita/2010006openalex-snapshot
Formal language properties of hybrid systems with strong resets
inferred← citeshttps://doi.org/10.1109/formalise.2019.00010openalex-snapshot
Clock Reduction in Timed Automata While Preserving Design Parameters
inferred← citeshttps://doi.org/10.1109/tac.2021.3064542openalex-snapshot
Observers for a Class of Timed Automata Based on Elapsed Time Graphs
inferred← citeshttps://doi.org/10.1109/tac.2024.3432788openalex-snapshot
Verification of State-Based Timed Opacity for Constant-Time Labeled Automata
inferred← citeshttps://doi.org/10.1109/tac.2025.3611993openalex-snapshot
Enforcement of Opacity for Interval Weighted Discrete-Event System by Supervisory Control
inferred← citeshttps://doi.org/10.1109/tase.2016.23openalex-snapshot
On-the-Fly Determinization of Bounded Networks of Timed Automata
inferred← citeshttps://doi.org/10.1145/3178126.3178138openalex-snapshot
Clock Allocation in Timed Automata and Graph Colouring
inferred← citeshttps://doi.org/10.1145/3841180openalex-snapshot
A Language-Theoretic Classification of Discrete-Time Discrete Event Systems
inferred← citeshttps://doi.org/10.15514/ispras-2018-30(3)-22openalex-snapshot
On the verification of strictly deterministic behaviour of Timed Finite State Machines
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:8)2012openalex-snapshot
Off-line test selection with test purposes for non-deterministic timed automata
inferred← citeshttps://doi.org/10.3233/fi-2009-0063openalex-snapshot
Undecidability Results for Timed Automata with Silent Transitions
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:9)2022openalex-snapshot
Determinisability of register and timed automata
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1215openalex-snapshot
Integer Reset Timed Automata: Clock Reduction and Determinizability
inferred← citeshttps://doi.org/10.48550/arxiv.1508.03575openalex-snapshot
Bounded Determinization of Timed Automata with Silent Transitions
inferred← citeshttps://doi.org/10.48550/arxiv.1811.10083openalex-snapshot
Real-Time Systems Modeling and Analysis
inferred← citeshttps://doi.org/10.70675/0e81790azc9bez4d63zac70ze4932217ec61openalex-snapshot
Automate sur les structures temporisée
inferred← citeshttps://doi.org/10.70675/48e3d1fbz6773z4afcz9cb8za12943935e0eopenalex-snapshot
Formal verification at design stage of diagnosis related properties for discrete event and real-time systems
inferred← citeshttps://doi.org/10.70675/9909c56dz2678z4612zba67z9d3f86555c83openalex-snapshot
Synthesis of correct-by-design schedulers for hybrid 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.