Axiomatising extended computation tree logic

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

Volumn 1059, Issue , 1996, Pages 87-101

  Kaivola, Roope ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; COMPUTER CIRCUITS; FORESTRY;

AXIOM SYSTEM; AXIOMATI-SATION; COMPUTATION TREE LOGIC; INFERENCE RULES; LINEAR TIME; LINEAR TIME TEMPORAL LOGIC; NORMAL FORM; SOUND AND COMPLETE;

TEMPORAL LOGIC;

EID: 84947918616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61064-2_31     Document Type: Conference Paper

References (25)

1. Banieqbal, B. & Barringer, H.: Temporal logic with fixed points, in Temporal Logic in Specification, LNCS vol. 398, Springer-Verlag, 1989, pp. 62-74
2. Barringer, H. & Kuiper, R. & Pnueli, A.: A really abstract concurrent model and its temporal logic, in Proc. of the 13th ACM POPL, 1986
3. Clarke, E. & Grumberg, O. & Kurshan, R. P.: A synthesis of two approaches for verifying finite state concurrent systems, in Logic at Botik'89, LNCS vol. 363, Springer-Verlag, 1989, pp. 81-90
4. Emerson, E. A.: Alternative semantics for temporal logics, in Theoretical Computer Science, vol. 26, 1983, pp. 121-130
5. Emerson, E. A.: Temporal and modal logic, in van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, Elsevier/North-Holland, 1990, pp. 997-1072
6. Emerson, E. A. & Clarke, E. M.: Characterising correctness properties of parallel programs using fixpoints, in Proc. of the 7th ICALP, LNCS vol. 85, Springer- Verlag, 1980, pp. 169-181
7. Emerson, E. A. & Halpern, J. Y.: Decision procedures and expressiveness in the temporal logic of branching time, in Journal of Computer and System Sciences, vol. 30, 1985, pp. 1-24
8. Emerson, E. A. & Jutla, C. S.: Tree automata, mu-calculus, and determinacy, in Proceedings of the 3Pnd FOCS, 1991, pp. 368-377
9. Emerson, E. A. & Sistla, A. P.: Deciding full branching time logic, in Information and Control, vol. 61, pp. 175-201, 1984
10. Gabbay, D. & Pnueli, A. & Shelah, S. & Stavi, J.: On the temporal analysis of fairness, in Proc of the 7th ACM POPL, 1980, pp. 163-173
11. Kaivola, R.: Axiomatising linear time mu-calculus, in Proc. of CONCUR'95, LNCS vol. 962, Springer-Verlag, 1995, pp. 423-437
12. Kozen, D.: Results on the propositional #-calculus, in Theoretical Computer Science, vol. 27, 1983, pp. 333-354
13. Lichtenstein, O.: Decidability, Completeness and Extensions of Linear Time Temporal Logic, PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, 1991
14. McNaughton, R.: Testing and generating infinite sequences by a finite automaton, in Information and Control, vol. 9, 1966, pp. 521-530
15. Mostowski, A. W.: Hierarchies of weak automata and weak monadic formulas, in Theoretical Computer Science, vol. 83, 1991, pp. 232-335
16. Stirring, C.: Modal and temporal logics, in Abramsky, S. & al. (eds.): Handbook of Logic in Computer Science, Oxford University Press, 1992, pp. 477-563
17. Stirring, C. & Walker, D.: Local model checking in the modal mu-calculus, in Theoretical Computer Science, vol. 89, 1991, pp. 161-177
18. Streett, R. S. & Emerson, E. A.: An automata theoretic decision procedure for the propositional mu-calculus, in Inf. and Comp., vol. 81, 1989, pp. 249-264
19. Thomas, W.: Computation tree logic and regular w-languages, in Linear Time, Branching Time and Partial Order in Concurrency, LNCS vol. 354, Springer- Verlag, 1988, pp. 690-713
20. Thomas, W.: Automata on infinite objects, in van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, vol. 2, North-Holland, 1989, pp. 133-191
21. Vardi, M. Y.: A temporal fixpoint calculus, in Proceedings of the 15th ACM POPL, 1988, pp. 250-259
22. Vardi, M. Y. & Wolper, P.: Yet another process logic, in Logics of Programs, LNCS vol. 164, Springer-Verlag, 1983, pp. 501-512
23. Vardi, M. Y. & Wolper, P.: Reasoning about infinite computations, in Information and Computation, vol. 115, 1994, pp. 1-37
24. Walukiewicz, I.: Completeness of Kozen's axiomatisation of the propositional - calculus, in Proc. of the lOth IEEE LICS, 1995
25. Wolper, P.: Temporal logic can be more expressive, in Information and Control, vol 56, 1983, pp. 72-99