A new one-pass tableau calculus for PLTL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1397 LNAI, Issue , 1998, Pages 277-291

  Schwendimann, Stefan ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC; TREES (MATHEMATICS);

CYCLIC GRAPH; DECISION METHOD; DECISION PROCEDURE; LINEAR TIME LOGIC; ONE-PASS; ONE-TIME; SECOND PHASE;

CALCULATIONS;

EID: 84886281835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69778-0_28     Document Type: Conference Paper

References (17)

1. M. Browne, E. Clarke, D. Dill, and B. Mishra. Automatic verification of sequential circuits using temporal logic. IEEE Transactions on Computers, 35:1035-1044, December 1986.
2. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. In Formal Methods in System Design, volume 1, pages 275-288, 1992.
3. M. D'Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors. Handbook of Tableau Methods, chapter Tableau Methods for Modal and Temporal Logics. Kluwer, to appear. (currently available as technical report TR-ARP-15-95, Australian National University (ANU)).
4. E. Emerson. Temporal and modal logic. In J. v. Leeuwen, editor, Handbook of Theoretical Computer Science. Volume B, pages 995-1072. Elsevier, 1990.
5. M.J. Fischer and R.L. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194-211, 1979.
6. M. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht, 1983.
7. R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembinski and M. Sredniawa, editors, Protocol Specification Testing and Verification, volume XV, pages 3-18. Chapman & Hall, 1996.
8. R. Goré Cut-free Sequent and Tableau Systems for Propositional Normal Modal Logic. PhD thesis, Computer Laboratory, University of Cambridge, England, 1992.
9. G. Gough. Decision procedures for temporal logic. Technical Report UMCS-89-10-1, Department of Computer Science, University of Manchester, 1989.
10. A. Heuerding, G. Jäger, S. Schwendimann, and M. Seyfried. Propositional logics on the computer. In P. Baumgartner, R. Hähnle, and J. Posegga, editors, Theorem Proving with Analytic Tableaux and Related Methods, LNCS 918, pages 310-323, 1995.
11. A. Heuerding, M. Seyfried, and H. Zimmermann. Efficient loop-check for backward proof search in some non-classical propositional logics. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Tableaux 96, LNCS 1071, pages 210-225, 1996.
12. Y. Kesten, Z. Manna, H. McGuire, and A.Pnueli. A decision algorithm for full propositional temporal logic. In Computer Aided Verification, LNCS 697, pages 4-35. Springer, 1993.
13. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag, 1991.
14. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
15. A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. Journal of the Association for Computing Machinery, 32(3):733-749, 1985.
16. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal Computing, 1(2):146-160, 1972.
17. P.Wolper. The tableau method for temporal logic: an overview. Logique et Analyse, 110-111:119-136, 1985.