Efficient parallel path checking for linear-time temporal logic with past and bounds

Logical Methods in Computer Science

Volumn 8, Issue 4, 2012, Pages

  Kuhtz, Lars ^a   Finkbeiner, Bernd ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Bounded temporal operators; Linear time temporal logic (LTL); Linear time temporal logic with past; Model checking; Parallel complexity; Path checking

Indexed keywords

CORE LOGIC; LINEAR TIME TEMPORAL LOGIC; MODEL CHECKING PROBLEM; PARALLEL COMPLEXITY; PARALLEL PATH; PATH-CHECKING; SINGLE PATH; TEMPORAL OPERATORS;

TEMPORAL LOGIC;

MODEL CHECKING;

EID: 84868089371     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(4:10)2012     Document Type: Article

References (31)

1. K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. J. Algorithms, 10(2):287-302, 1989.
2. R. Armoni, D. Korchemny, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. Deterministic dynamic monitors for linear-time assertions. In Proc. FATES/RV'06, LNCS. Springer, 2006.
3. Cyrille Artho, Howard Barringer, Allen Goldberg, Klaus Havelund, Sarfraz Khurshid, Mike Lowry, Corina Pasareanu, Grigore Rosu, Koushik Sen, Willem Visser, and Rich Washington. Combining test case generation and runtime verification. Theoretical Computer Science, 336(2-3):209-234, 2005.
4. th Annual IEEE Conference on Computational Complexity (COCO'99), pages 24-31, Washington, DC, USA, 1999. IEEE Computer Society.
5. M. Boule and Z. Zilic. Automata-based assertion-checker synthesis of PSL properties. ACM Transactions on Design Automation of Electronic Systems (TODAES), 13(1), 2008.
6. T. Chakraborty and S. Datta. One-input-face MPCVP is hard for L, but in LogDCFL. In Proc. FSTTCS, volume 4337 of LNCS, pages 57-68. Springer, 2006.
7. A. Dahan, D. Geist, L. Gluhovsky, D. Pidan, G. Shapir, Y. Wolfsthal, L. Benalycherif, R. Kamdem, and Y. Lahbib. Combining system level modeling with assertion based verification. In Proc. ISQED'05, pages 310-315. IEEE Computer Society, 2005.
8. A.L. Delcher and S.R. Kosaraju. An NC algorithm for evaluating monotone planar circuits. SIAM J. Comput., 24(2):369-375, 1995.
9. S. Demri and Ph. Schnoebelen. The complexity of propositional linear temporal logics in simple cases. Inf. Comput., 174(1):84-103, 2002.
10. P.W. Dymond and S.A. Cook. Complexity theory of parallel time and hardware. Information and Computation, 80(3):205-226, 1989.
11. B. Finkbeiner and L. Kuhtz. Monitor circuits for LTL with bounded and unbounded future. In Proc. RV'09, LNCS. Springer, 2009.
12. B. Finkbeiner and H.B. Sipma. Checking finite traces using alternating automata. Formal Methods in System Design, 24:101-127, 2004.
13. L.M. Goldschlager. A space efficient algorithm for the monotone planar circuit value problem. Inf. Process. Lett., 10(1):25-27, 1980.
14. K. Havelund and G. Roşu. Efficient monitoring of safety properties. STTT, 6(2):158-173, 2004.
15. IEEE Std 1850-2007. Property Specification Language (PSL). IEEE, New York, 2007.
16. T. Jiang and B. Ravikumar. A note on the space complexity of some decision problems for finite automata. Information Processing Letters, 40:25-31, 1991.
17. D.S. Johnson. A catalog of complexity classes. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pages 67-161. MIT Press, 1990.
18. Richard M. Karp and Vijaya Ramachandran. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pages 869-942. MIT Press, 1990.
19. S. Rao Kosaraju and Arthur L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. In VLSI Algorithms and Architectures: Proceedings of the 3rd Aegean Workshop on Computing, pages 101-110. Springer-Verlag, 1988.
20. S.R. Kosaraju. On parallel evaluation of classes of circuits. In Proc. FSTTCS, volume 472 of LNCS, pages 232-237. Springer, 1990.
21. L. Kuhtz. Model Checking Finite Paths and Trees. PhD thesis, Universiẗat des Saarlandes, 2010.
22. L. Kuhtz and B. Finkbeiner. LTL path checking is efficiently parallelizable. In Proc. ICALP'09, volume 5556 of LNCS, pages 235-246. Springer, 2009.
23. F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal logic with forgettable past. In Proc. LICS, pages 383-392. IEEE Computer Society, 2002.
24. O. Lichtenstein, A. Pnueli, and L.D. Zuck. The glory of the past. In Proceedings of the Conference on Logic of Programs, pages 196-218, London, UK, 1985. Springer.
25. N. Limaye, M. Mahajan, and J.M.N. Sarma. Evaluating monotone circuits on cylinders, planes and tori. In B. Durand and W. Thomas, editors, Proc. STACS, volume 3884 of LNCS, pages 660-671. Springer, 2006.
26. N. Markey and Ph. Schnoebelen. Model checking a path (preliminary report). In Proc. CONCUR, volume 2761 of LNCS, pages 251-265. Springer, 2003.
27. H. Petersen. Decision problems for generalized regular expressions. In 2nd International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, London(Ontario), pages 22-29, 2000.
28. H. Petersen. The membership problem for regular expressions with intersection is complete in LOGCFL. In Proc. STACS, volume 2285 of LNCS, pages 513-522. Springer, 2002.
29. Heribert Vollmer. Introduction to Circuit Complexity: A Uniform Approach. Springer, 1999.
30. H. Yang. An NC algorithm for the general planar monotone circuit value problem. In Proc. SPDP, pages 196-203. IEEE Computer Society, 1991.
31. H.L.S Younes and R.G. Simmons. Probabilistic verification of discrete event systems using acceptance sampling. In Proc. CAV, volume 2404 of LNCS. Springer, 2002.