Satisfiability for MTL and TPTL over Non-monotonic Data Words

DOI10.1007/978-3-319-04921-2_20zbMath1407.68284OpenAlexW282838243MaRDI QIDQ5404916

Shiguang Feng, Claudia Carapelle, Karin Quaas, Oliver Fernández Gil

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_20

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Path Checking for MTL and TPTL over Data Words

This page was built for publication: Satisfiability for MTL and TPTL over Non-monotonic Data Words