Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis

Authors:
Valentin Goranko;Angelo Kyrilov;Dmitry Shkatov
Affiliations:
DTU Informatics, Technical University of Denmark, Kgs. Lyngby, Denmark;School of Computer Science, University of the Witwatersrand, Johannesburg, South Africa;School of Computer Science, University of the Witwatersrand, Johannesburg, South Africa
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 8
Cited 3

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
A New One-Pass Tableau Calculus for PLTL

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The complexity of propositional linear temporal logics

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge

SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
LTL satisfiability checking

Proceedings of the 14th international SPIN conference on Model checking software
One-pass tableaux for computation tree logic

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

A multi-encoding approach for LTL symbolic satisfiability checking

FM'11 Proceedings of the 17th international conference on Formal methods
Invariant-Free Clausal Temporal Resolution

Journal of Automated Reasoning
Logical foundations for more expressive declarative temporal logic programming languages

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report on the implementation and experimental analysis of an incremental multi-pass tableau-based procedure a la Wolper for testing satisfiability in the linear time temporal logic LTL, based on a breadth-first search strategy. We describe the implementation and discuss the performance of the tool on several series of pattern formulae, as well as on some random test sets, and compare its performance with an implementation of Schwendimann's one-pass tableaux by Widmann and Gore on several representative series of pattern formulae, including eventualities and safety patterns. Our experiments have established that Schwendimann's algorithm consistently, and sometimes dramatically, outperforms the incremental tableaux, despite the fact that the theoretical worst-case upper-bound of Schwendimann's algorithm, 2EXPTIME, is worse than that of Wolper's algorithm, which is EXPTIME. This shows, once again, that theoretically established worst-case complexity results do not always reflect truly the practical efficiency, at least when comparing decision procedures.