On the public citation graph
Binary Reachability Analysis of Discrete Pushdown Timed Automata
0 signed · 90 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.1006/inco.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferredcites →https://doi.org/10.1006/inco.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1007/3-540-46419-0_12openalex-snapshot
Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems
inferredcites →https://doi.org/10.1007/3-540-48320-9_18openalex-snapshot
Timed Automata and the Theory of Real Numbers
inferredcites →https://doi.org/10.1007/3-540-48683-6_30openalex-snapshot
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
inferredcites →https://doi.org/10.1007/3-540-58179-0_43openalex-snapshot
Symbolic verification with periodic sets
inferredcites →https://doi.org/10.1007/3-540-60472-3_4openalex-snapshot
On the automatic verification of systems with continuous variables and unbounded discrete data structures
inferredcites →https://doi.org/10.1007/3-540-61474-5_58openalex-snapshot
Pushdown processes: Games and model checking
inferredcites →https://doi.org/10.1007/3-540-63141-0_10openalex-snapshot
Reachability analysis of pushdown automata: Application to model-checking
inferredcites →https://doi.org/10.1007/bfb0028751openalex-snapshot
Multiple counters automata, safety analysis and presburger arithmetic
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1016/0022-0000(81)90028-3openalex-snapshot
The complexity of decision problems for finite-turn multicounter machines
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/s1571-0661(05)80426-8openalex-snapshot
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
inferredcites →https://doi.org/10.1109/32.629494openalex-snapshot
Specification of realtime systems using ASTRAL
inferredcites →https://doi.org/10.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems
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_27openalex-snapshot
Adding Monotonic Counters to Automata and Transition Graphs
inferred← citeshttps://doi.org/10.1007/11560647_18openalex-snapshot
Symbolic Model Checking of Finite Precision Timed Automata
inferred← citeshttps://doi.org/10.1007/11787006_44openalex-snapshot
On Intersection Problems for Polynomially Generated Sets
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_48openalex-snapshot
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_38openalex-snapshot
Counter Machines: Decidable Properties and Applications to Verification Problems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_15openalex-snapshot
Reachability Analysis for Some Models of Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_12openalex-snapshot
Reachability and Safety in Queue Systems
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_13openalex-snapshot
Generalizing the Discrete Timed Automaton
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_59openalex-snapshot
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_12openalex-snapshot
On Presburger Liveness of Discrete Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45005-x_29openalex-snapshot
Safety Verification for Two-Way Finite Automata with Monotonic Counters
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_18openalex-snapshot
Automatic Verification of Multi-queue Discrete Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_16openalex-snapshot
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_12openalex-snapshot
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_22openalex-snapshot
On Removing the Pushdown Stack in Reachability Constructions
inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_11openalex-snapshot
Two-Way Parikh Automata with a Visibly Pushdown Stack
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_21openalex-snapshot
Revisiting Underapproximate Reachability for Multipushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_23openalex-snapshot
Lossiness of Communication Channels Modeled by Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-09039-9_4openalex-snapshot
Sampling a Two-Way Finite Automaton
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_2openalex-snapshot
Automata with Reversal-Bounded Counters: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_50openalex-snapshot
Quantifying Communication in Synchronized Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_7openalex-snapshot
Security of Numerical Sensors in Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-66335-7_1openalex-snapshot
Extending Parikh’s Theorem to Weighted and Probabilistic Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-94812-6_18openalex-snapshot
Semilinearity of Families of Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_17openalex-snapshot
Reasoning About Reversal-Bounded Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_17openalex-snapshot
Real-Counter Automata and Their Decision Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_34openalex-snapshot
Composability of Infinite-State Activity Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_8openalex-snapshot
Dense Counter Machines and Verification Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_16openalex-snapshot
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_45openalex-snapshot
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_60openalex-snapshot
Model Checking Recursive Programs with Numeric Data Types
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_6openalex-snapshot
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_22openalex-snapshot
Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_21openalex-snapshot
Execution Information Rate for Some Classes of Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_20openalex-snapshot
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.038openalex-snapshot
Reachability in Timed Counter Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2015.11.006openalex-snapshot
Execution information rate for some classes of automata
inferred← citeshttps://doi.org/10.1016/j.ic.2017.04.008openalex-snapshot
Information rate of some classes of non-regular languages: An automata-theoretic approach
inferred← citeshttps://doi.org/10.1016/j.ic.2019.03.003openalex-snapshot
On store languages and applications
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.11.003openalex-snapshot
Reachability relations of timed pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.004openalex-snapshot
Past pushdown timed automata and safety verification
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.015openalex-snapshot
Linear reachability problems and minimal solutions to linear Diophantine equation systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.009openalex-snapshot
On composition and lookahead delegation of e -services modeled by automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.040openalex-snapshot
Similarity in languages and programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.012openalex-snapshot
Sampling automata and programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.042openalex-snapshot
Quantifying communication in synchronized languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.035openalex-snapshot
Grammatical characterizations of NPDAs and VPDAs with counters
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00268-7openalex-snapshot
Counter Machines and Verification Problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00269-9openalex-snapshot
Augmenting the discrete timed automaton with other data structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00076-2openalex-snapshot
Verification in loosely synchronous queue-connected discrete timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00432-2openalex-snapshot
Generalized discrete timed automata: decidable approximations for safety verification
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00485-1openalex-snapshot
Presburger liveness verification of discrete timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00545-5openalex-snapshot
Eliminating the storage tape in reachability constructions
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00743-0openalex-snapshot
Pushdown timed automata: a binary reachability characterization and safety verification
inferred← citeshttps://doi.org/10.1109/lics.2010.21openalex-snapshot
Parikh Images of Grammars: Complexity and Applications
inferred← citeshttps://doi.org/10.1109/lics.2015.39openalex-snapshot
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
inferred← citeshttps://doi.org/10.1142/s0129054101000898openalex-snapshot
ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0129054102001539openalex-snapshot
THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0129054120420095openalex-snapshot
Semilinearity of Families of Languages
inferred← citeshttps://doi.org/10.1145/1342991.1342996openalex-snapshot
Durations and parametric model-checking in timed automata
inferred← citeshttps://doi.org/10.1145/3632843openalex-snapshot
Ramsey Quantifiers in Linear Arithmetics
inferred← citeshttps://doi.org/10.1360/jos170001openalex-snapshot
Reachability Checking of Finite Precision Timed Automata
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25da8openalex-snapshot
Revisiting Underapproximate Reachability for Multipushdown Systems
inferred← citeshttps://doi.org/10.3233/aic-2012-0523openalex-snapshot
Towards efficient MUS extraction
inferred← citeshttps://doi.org/10.3233/com-150050openalex-snapshot
Lossiness of communication channels modeled by transducers
inferred← citeshttps://doi.org/10.4204/eptcs.140.3openalex-snapshot
Zenoness for Timed Pushdown Automata
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.118openalex-snapshot
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms
inferred← citeshttps://doi.org/10.48550/arxiv.1002.1464openalex-snapshot
Parikh Images of Regular Languages: Complexity 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.