Path checking for MTL and TPTL over data words

DOI10.1007/978-3-319-21500-6_26MaRDI QIDQ6829345zbMATH OpenFDO

Authors Shiguang Feng, Markus Lohrey, Karin Quaas

Publication date 10 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21500-6_26

Mathematics Subject Classification ID

Temporal logic (03B44) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

This page was built for publication: Path checking for MTL and TPTL over data words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829345)