On the public citation graph

Decidability and Complexity Results for Timed Automata via Channel Machines

0 signed · 66 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.1025openalex-snapshot
Real-Time Logics: Complexity and Expressiveness
inferredcites →https://doi.org/10.1006/inco.1996.0003openalex-snapshot
Unreliable Channels Are Easier to Verify Than Perfect Channels
inferredcites →https://doi.org/10.1006/inco.1996.0083openalex-snapshot
Undecidable Verification Problems for Programs with Unreliable Channels
inferredcites →https://doi.org/10.1006/jcss.1998.1581openalex-snapshot
What's Decidable about Hybrid Automata?
inferredcites →https://doi.org/10.1007/3-540-36580-x_28openalex-snapshot
Universality and Language Inclusion for Open and Closed Timed Automata
inferredcites →https://doi.org/10.1007/3-540-55719-9_103openalex-snapshot
What good are digital clocks?
inferredcites →https://doi.org/10.1007/3-540-64358-3openalex-snapshot
Hybrid Systems: Computation and Control: First International Workshop, HSCC'98, Berkeley, California, USA, April 13 - 15, 1998, Proceedings
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_19openalex-snapshot
Reversible Communicating Systems
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_25openalex-snapshot
Model Checking Timed Automata with One or Two 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-31954-2_5openalex-snapshot
Perturbed Timed Automata
inferredcites →https://doi.org/10.1007/978-3-540-31982-5_16openalex-snapshot
Alternating Timed Automata
inferredcites →https://doi.org/10.1007/b110123openalex-snapshot
Formal Methods for the Design of Real-Time Systems
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
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.1016/j.tcs.2004.04.003openalex-snapshot
Updatable timed automata
inferredcites →https://doi.org/10.1016/s0020-0190(01)00337-4openalex-snapshot
Verifying lossy channel systems has nonprimitive recursive complexity
inferredcites →https://doi.org/10.1016/s0304-3975(00)00102-xopenalex-snapshot
Well-structured transition systems everywhere!
inferredcites →https://doi.org/10.1016/s0304-3975(01)00330-9openalex-snapshot
Model checking of systems with many identical timed processes
inferredcites →https://doi.org/10.1016/s0304-3975(02)00646-1openalex-snapshot
Undecidable problems in unreliable computations
inferredcites →https://doi.org/10.1016/s0304-3975(97)00173-4openalex-snapshot
Event-clock automata: a determinizable class of timed automata
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.2005.33openalex-snapshot
On the Decidability of Metric Temporal Logic
inferredcites →https://doi.org/10.1145/112600.112613openalex-snapshot
The benefits of relaxing punctuality
inferredcites →https://doi.org/10.1145/1342991.1342994openalex-snapshot
Alternating 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.1002/9780470611012.ch4openalex-snapshot
Model Checking Timed Automata
inferred← citeshttps://doi.org/10.1007/11690634_15openalex-snapshot
On Metric Temporal Logic and Faulty Turing Machines
inferred← citeshttps://doi.org/10.1007/11691372_27openalex-snapshot
Safety Metric Temporal Logic Is Fully Decidable
inferred← citeshttps://doi.org/10.1007/11730637_17openalex-snapshot
Decision Problems for the Verification of Real-Time Software
inferred← citeshttps://doi.org/10.1007/11867340_14openalex-snapshot
Undecidable Problems About Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-63461-2_15openalex-snapshot
Synthesizing Clock-Efficient Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-92137-8_8openalex-snapshot
Minimization of the Number of Clocks for Timed Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-031-07727-2_10openalex-snapshot
Untangling the Graphs of Timed Automata to Decrease the Number of Clocks
inferred← citeshttps://doi.org/10.1007/978-3-031-22476-8_1openalex-snapshot
An Efficient Customized Clock Allocation Algorithm for a Class of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-35355-0_7openalex-snapshot
Operations on Timed Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-031-62645-6_8openalex-snapshot
Synthesizing Timed Automata with Minimal Numbers of Clocks from Optimised Timed Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_29openalex-snapshot
Model Checking Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_15openalex-snapshot
Model Checking Probabilistic Timed Automata with One or Two Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_2openalex-snapshot
Sampled Universality of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_22openalex-snapshot
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_8openalex-snapshot
The ω-Regular Post Embedding Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_50openalex-snapshot
Event-Clock Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_10openalex-snapshot
Complexity Bounds for the Verification of Real-Time Software
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_22openalex-snapshot
Cutting through Regular Post Embedding Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_11openalex-snapshot
Unidirectional Channel Systems Can Be Tested
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_23openalex-snapshot
The Power of Priority Channel Systems
inferred← citeshttps://doi.org/10.1007/s00224-014-9561-9openalex-snapshot
Generalized Post Embedding Problems
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.1109/lics.2005.33openalex-snapshot
On the Decidability of Metric Temporal Logic
inferred← citeshttps://doi.org/10.1109/lics.2008.47openalex-snapshot
The Ordinal Recursive Complexity of Lossy Channel Systems
inferred← citeshttps://doi.org/10.1145/1342991.1342994openalex-snapshot
Alternating timed automata
inferred← citeshttps://doi.org/10.1145/2103621.2103704openalex-snapshot
Towards nominal computation
inferred← citeshttps://doi.org/10.1145/2103656.2103704openalex-snapshot
Towards nominal computation
inferred← citeshttps://doi.org/10.2168/lmcs-10(4:4)2014openalex-snapshot
The Power of Priority Channel Systems
inferred← citeshttps://doi.org/10.2168/lmcs-4(3:12)2008openalex-snapshot
Model Checking Probabilistic Timed Automata with One or Two Clocks
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:22)2012openalex-snapshot
Alternating register automata on finite words and trees
inferred← citeshttps://doi.org/10.3233/fi-2016-1316openalex-snapshot
Relating Reachability Problems in Timed and Counter Automata
inferred← citeshttps://doi.org/10.4204/eptcs.117.8openalex-snapshot
Solving Stochastic Büchi Games on Infinite Arenas with a Finite Attractor
inferred← citeshttps://doi.org/10.4204/eptcs.41.5openalex-snapshot
Relating timed and register automata
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.37openalex-snapshot
On Flat Lossy Channel Machines
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512031openalex-snapshot
Alternating Timed Automata
inferred← citeshttps://doi.org/10.5555/1775223.1775230openalex-snapshot
Zone-based universality analysis for single-clock timed automata
inferred← citeshttps://doi.org/10.70675/25d20a7dzfea8z4000z8826z89056423c46dopenalex-snapshot
Reasoning on words and trees with data
inferred← citeshttps://doi.org/10.70675/6c9d51cbze0efz4fdezb9b8z4ddc2f8fce0fopenalex-snapshot
Subwords : automata, embedding problems, and verification
inferred← citeshttps://doi.org/10.70675/7c36bc77zbcf8z4d6ez988dzdd814ec9a952openalex-snapshot
Role of the immune receptor CD47 in mouse model of non-infectious uveitis
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.