LTL with the freeze quantifier and register automata

DOI10.1145/1507244.1507246zbMath1351.68158MaRDI QIDQ2946574

Stéphane P. Demri, Ranko Lazić

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1507244.1507246

zbMATH Keywords

computational complexity; expressiveness

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

03B25: Decidability of theories and sets of sentences

03B44: Temporal logic

Related Items

An automata-theoretic approach to constraint LTL