On the Complexity of Temporal-Logic Path Checking

DOI10.1007/978-3-662-43951-7_8zbMath1410.68219arXiv1312.7603OpenAlexW1570669451MaRDI QIDQ5167829

Daniel Bundala, Joël Ouaknine

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (3)

Path Checking for MTL and TPTL over Data Words ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Unnamed Item

This page was built for publication: On the Complexity of Temporal-Logic Path Checking