Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds

DOI10.2168/LMCS-8(4:10)2012zbMath1253.68221arXiv1210.0574MaRDI QIDQ4899110

Bernd Finkbeiner, Lars Kuhtz

Publication date: 7 January 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

parallel complexitymodel checkinglinear-time temporal logic with pastpath checkinglinear-time temporal logic (LTL)bounded temporal operators

Mathematics Subject Classification ID

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

Related Items

Path Checking for MTL and TPTL over Data Words, The ins and outs of first-order runtime verification, A survey of challenges for runtime verification from advanced application domains (beyond software), A theory of monitors