On the public citation graph

The Effects of Bounding Syntactic Resources on Presburger LTL

https://doi.org/10.1093/logcom/exp037
0 signed · 63 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.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1006/inco.2000.2894openalex-snapshot
Pushdown Processes: Games and Model-Checking
inferredcites →https://doi.org/10.1006/inco.2001.3094openalex-snapshot
The Complexity of Propositional Linear Temporal Logics in Simple Cases
inferredcites →https://doi.org/10.1007/11690634_23openalex-snapshot
Parity Games Played on Transition Graphs of One-Counter Processes
inferredcites →https://doi.org/10.1007/11817963_47openalex-snapshot
Programs with Lists Are Counter Automata
inferredcites →https://doi.org/10.1007/3-540-36206-1_14openalex-snapshot
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
inferredcites →https://doi.org/10.1007/3-540-44612-5_38openalex-snapshot
Counter Machines: Decidable Properties and Applications to Verification Problems
inferredcites →https://doi.org/10.1007/3-540-44622-2_17openalex-snapshot
Flatness Is Not a Weakness
inferredcites →https://doi.org/10.1007/3-540-44683-4_18openalex-snapshot
Automatic Verification of Recursive Procedures with One Integer Parameter
inferredcites →https://doi.org/10.1007/3-540-45022-x_28openalex-snapshot
Efficient Verification Algorithms for One-Counter Processes
inferredcites →https://doi.org/10.1007/3-540-45988-x_13openalex-snapshot
Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning
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/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-30195-0_23openalex-snapshot
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_23openalex-snapshot
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
inferredcites →https://doi.org/10.1007/978-3-540-45187-7_15openalex-snapshot
Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE
inferredcites →https://doi.org/10.1007/978-3-642-04081-8_25openalex-snapshot
Reachability in Succinct and Parametric One-Counter Automata
inferredcites →https://doi.org/10.1007/bfb0028751openalex-snapshot
Multiple counters automata, safety analysis and presburger arithmetic
inferredcites →https://doi.org/10.1016/0004-3702(95)00018-aopenalex-snapshot
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
inferredcites →https://doi.org/10.1016/0022-0000(86)90006-1openalex-snapshot
A multiparameter analysis of the boundedness problem for vector addition systems
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.50007-xopenalex-snapshot
Context-Free Languages
inferredcites →https://doi.org/10.1016/j.ic.2006.09.006openalex-snapshot
An automata-theoretic approach to constraint LTL
inferredcites →https://doi.org/10.1016/j.tcs.2008.07.023openalex-snapshot
Verification of qualitative Z constraints
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1016/s0304-3975(02)00397-3openalex-snapshot
Automatic verification of recursive procedures with one integer parameter
inferredcites →https://doi.org/10.1016/s0304-3975(02)00485-1openalex-snapshot
Presburger liveness verification of discrete timed automata
inferredcites →https://doi.org/10.1016/s0890-5401(03)00139-1openalex-snapshot
Model checking LTL with regular valuations for pushdown systems
inferredcites →https://doi.org/10.1016/s0890-5401(03)00171-8openalex-snapshot
DP lower bounds for equivalence-checking and model-checking of one-counter automata
inferredcites →https://doi.org/10.1109/lics.1995.523250openalex-snapshot
On the verification problem of nonregular properties for nonregular processes
inferredcites →https://doi.org/10.1109/lics.2005.33openalex-snapshot
On the Decidability of Metric Temporal Logic
inferredcites →https://doi.org/10.1145/1017074.1017096openalex-snapshot
On validation of XML streams using finite state machines
inferredcites →https://doi.org/10.1145/1024922.1024925openalex-snapshot
NEXP TIME-complete description logics with concrete domains
inferredcites →https://doi.org/10.1145/1342991.1342994openalex-snapshot
Alternating timed automata
inferredcites →https://doi.org/10.1145/174644.174651openalex-snapshot
A really temporal logic
inferredcites →https://doi.org/10.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/73560.73582openalex-snapshot
A temporal fixpoint calculus

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-319-11936-6_6openalex-snapshot
Quantitative Verification of Weighted Kripke Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_27openalex-snapshot
On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_25openalex-snapshot
Reachability in Succinct and Parametric One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_13openalex-snapshot
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_48openalex-snapshot
Model Checking Succinct and Parametric One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_23openalex-snapshot
Recursive Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_9openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_27openalex-snapshot
Shortest Paths in One-Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_16openalex-snapshot
Dynamic Complexity of the Dyck Reachability
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.apal.2009.07.004openalex-snapshot
Reasoning about sequences of memory states
inferred← citeshttps://doi.org/10.1093/logcom/exr013openalex-snapshot
Temporal Logics of Repeating Values
inferred← citeshttps://doi.org/10.1145/2893582.2893585openalex-snapshot
The complexity of reachability in vector addition systems
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:19)2019openalex-snapshot
Shortest paths in one-counter systems
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:33)2019openalex-snapshot
The Complexity of Flat Freeze LTL
inferred← citeshttps://doi.org/10.3233/fi-2016-1316openalex-snapshot
Relating Reachability Problems in Timed and Counter Automata
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.69openalex-snapshot
Weighted Strategy Logic with Boolean Goals Over One-Counter Games
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.81openalex-snapshot
Automata based verification over linearly ordered data domains
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0946openalex-snapshot
Constraint LTL Satisfiability Checking without Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1409.5681openalex-snapshot
Model-checking Quantitative Alternating-time Temporal Logic on One-counter Game Models
inferred← citeshttps://doi.org/10.5287/ora-gpjjqxr6jopenalex-snapshot
On the complexity of model checking counter automata
inferred← citeshttps://doi.org/10.65109/pqyy7743openalex-snapshot
Rational Synthesis in the Commons with Careless and Careful Agents
inferred← citeshttps://doi.org/10.70675/528cca31zda00z495bz9f43zfaa093704541openalex-snapshot
Separation logic : expressiveness, complexity, temporal extension
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.