The Effects of Bounding Syntactic Resources on Presburger LTL
From MaRDI portal
Publication:3656780
DOI10.1093/logcom/exp037zbMath1193.03033OpenAlexW2167135424MaRDI QIDQ3656780
Régis Gascon, Stéphane P. Demri
Publication date: 14 January 2010
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exp037
Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items
Reachability in Succinct and Parametric One-Counter Automata ⋮ An automata-theoretic approach to constraint LTL ⋮ Unnamed Item ⋮ Reasoning about sequences of memory states ⋮ Dynamic Complexity of the Dyck Reachability ⋮ Constraint LTL satisfiability checking without automata ⋮ Shortest Paths in One-Counter Systems ⋮ The Complexity of Flat Freeze LTL
