LTL Path Checking Is Efficiently Parallelizable

Download PDF
Open Webpage

Lars Kuhtz, Bernd Finkbeiner

Published: 2009, Last Modified: 26 Jan 2026ICALP (2) 2009EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We present an AC 1(logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a foundation for the parallelization of various applications in monitoring, testing, and verification.