Path Checking for MTL and TPTL over Data Words

DOI10.1007/978-3-319-21500-6_26zbMath1434.68297arXiv1412.3644MaRDI QIDQ3451113

Markus Lohrey, Karin Quaas, Shiguang Feng

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.3644

zbMATH Keywords

metric temporal logic; data words; freeze LTL; deterministic one-counter machines; path checking problem; times propositional temporal logic

Mathematics Subject Classification ID

68Q45: Formal languages and automata

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

03B44: Temporal logic