Kuhtz, Lars and Finkbeiner, Bernd - Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds

lmcs:1219 - Logical Methods in Computer Science, October 23, 2012, Volume 8, Issue 4
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds

Authors: Kuhtz, Lars and Finkbeiner, Bernd

Path checking, the special case of the model checking problem where the model under consideration is a single path, plays an important role in monitoring, testing, and verification. We prove that for linear-time temporal logic (LTL), path checking can be efficiently parallelized. In addition to the core logic, we consider the extensions of LTL with bounded-future (BLTL) and past-time (LTL+Past) operators. Even though both extensions improve the succinctness of the logic exponentially, path checking remains efficiently parallelizable: Our algorithm for LTL, LTL+Past, and BLTL+Past is in AC^1(logDCFL) \subseteq NC.


Source : oai:arXiv.org:1210.0574
DOI : 10.2168/LMCS-8(4:10)2012
Volume: Volume 8, Issue 4
Published on: October 23, 2012
Submitted on: January 4, 2010
Keywords: Computer Science - Logic in Computer Science,F.4.1, F.2.2


Share

Consultation statistics

This page has been seen 61 times.
This article's PDF has been downloaded 18 times.