A tableau calculus for first-order branching time logic

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

Volumn 1085, Issue , 1996, Pages 399-413

  May, Wolfgang ^a   Schmitt, Peter H ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS;

BRANCHING TIME; COUNTER-MODELS; EXPLICIT REPRESENTATION; FAIRNESS PROPERTIES; FIRST ORDER LOGIC; INTERACTIVE PROOF SYSTEM; LABELLED DEDUCTIVE SYSTEMS; PATH SEGMENTS;

TEMPORAL LOGIC;

EID: 0005484470     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61313-7_89     Document Type: Conference Paper

References (15)

1. M. Ben-Ari, Z. Manna, A. Pnueli: The Temporal Logic of Branching Time. Proc. of the 8th ACM Symp. on Principles of Programming Languages, 1981.
2. M. Clarke, E. A. Emerson: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. Proc. of the IBM Workshop on Logics of Programs, Springer LNCS 131, 1981.
3. E. M. Clarke, E. A. Emerson, A. P. Sistla: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Tr. on Programming Languages and Systems, Vol. 8, № 2, 1986.
4. E. A. Emerson, E. M. Clarke: Characterizing Properties of Parallel Programs as Fixpoints. Proc. of the 7th Int. Coll, on Automata, Languages and Programming. Springer LNCS 85, 1980.
5. E. A. Emerson, J. Y. Halpern: Decision Procedures and Expressiveness in the Temporal Logic of Branching Time. Proc. of the 14th ACM Symp. on Computing, 1982.
6. E. A. Emerson, J. Y. Halpern: "Sometimes" and "not never" revisited: On Branching Time versus Linear Time in Temporal Logic. Proc. of the 10th ACM Symp. on Principles of Programming Languages, 1983.
7. E. A. Emerson, C.-L. Lei: Modalities for Model Checking: Branching Time Strikes Back. Proc. of the 12th ACM Symp. on Principles of Programming Languages, 1985.
8. M. Fitting: First Order Logic and Automated Theorem Proving. Springer, New York, 1990.
9. D. M. Gabbay, I. Hodkinson, M. Reynolds: Temporal Logic. Mathematical Foundations and Computational Aspects. Vol. 1. Clarendon Press, Oxford Logic Guides № 28, 1994.
10. L. Lamport: "Sometimes" is Sometimes "Not Never". Proc. of the 7th ACM Symp. on Principles of Programming Languages, 1980.
11. D. Lehmann, A. Pnueli, J. Stavi: Impartiality, Justice, and Fairness: The Ethics of Concurrent Termination. Proc. of the 8th Int. Coll, on Automata, Languages and Programming. Springer LNCS 115, 1981.
12. W. May: Protokollverifikation in Temporallogik: Evolving Algebras und ein Tableaukalkül. Diplomarbeit, Universität Karlsruhe, 1995.
13. Z. Manna, A. Pnueli: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, 1992.
14. S. V. Reeves: Semantic Tableaux as a Framework for Automated Theorem-Proving. Dept, of Comp. Sc. and Statistics, Queen Mary College, Univ. of London.
15. P. Wolper: The Tableau Method for Temporal Logic. Logique et Analyse, 110-111, vol. 28, 1985.