Deciding branching time logic

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1984, Pages 14-24

  Emerson, E Allen ^a   Sistla, A Prasad ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS;

BINARY RELATION; BRANCHING TIME; DECISION PROCEDURE; EXPONENTIAL TIME; EXPRESSIVE POWER; PATH QUANTIFIERS; SPECIAL STRUCTURE; TEMPORAL FORMULAE;

TEMPORAL LOGIC;

EID: 79955039318     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800057.808661     Document Type: Conference Paper

References (25)

1. [AB80] Abrahamson, K., Decidability and Expressiveness of Logics of Processes, PhD Thesis, Univ. of Washington, 1980.
2. [BMP81] Ben-Ari, M., Manna, Z., and Pnueli, A., The Temporal Logic of Branching Time. 8th Annual ACM Symp. on Principles of Programming Languages, 1981.
3. [CE81] Clarke, E. M., and Emerson, E. A., Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic, Proceedings of the IBM Workshop on Logics of Programs, Springer-Verlag Lecture Notes in Computer Science #131, 1981.
4. [CES83] Clarke, E. M., Emerson, E. A., and Sistla, A.. P., Automatic Verification of Finite State Concurrent Programs: A Practical Approach, POPL83.
5. [EC82] Emerson, E. A., and Clarke, E. M., Using Branching Time Logic to Synthesize Synchronization Skeletons, Science of Computer Programming, vol. 2, pp. 241-266, 1982.
6. [EH82] Emerson, E. A., and Halpern, J. Y., Decision Procedures and Expressiveness in the Temporal Logic of Branching Time. 14th Annual ACM Symp. on Theory of Computing, 1982.
7. [EH83] Emerson, E. A., and Halpern, J. Y., 'Sometimes' and 'Not Never' Revisited: On Branching versus Linear Time. POPL83.
8. [EM83] Emerson, E. A., Alternative Semantics for Temporal Logics, Theoretical Computer Science, vol. 26, pp. 121-130, 1983.
9. [FL79] Fischer, M. J., and Ladner, R. E, Prepositional Dynamic Logic of Regular Programs, JCSS vol. 18, pp. 194-211, 1979.
10. [GPSS80] Gabbay, D., Pnueli, A., et al., The Temporal Analysis of Fairness. 7th Annual ACM Symp. on Principles of Programming Languages, 1980.
11. [HR72] Hossley, R., and Rackoff, C, The Emptiness Problem For Automata on Infinite Trees, Proc. 13th IEEE Symp. Switching and Automata Theory, pp. 121-124, 1972.
12. [LA80] Lamport, L., "Sometimes" is Sometimes "Not Never." 7th Annual ACM Symp. on Principles of Programming Languages, 1980.
13. [McN66] McNaughton, R., Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, vol. 9, 1966.
14. [MP79] Manna, Z., and Pnueli, A., The modal logic of programs, Proc. 6th Int. Colloquium on Automata, Languages, and Programming, Springer-Verlag Lecture Notes in Computer Science #71, pp. 385-410, 1979.
15. [ME74] Meyer, A. R., Weak Monadic Second Order Theory of Successor is Not Elementary Recursive, Boston Logic Colloquium, Springer- Verlag Lecture Notes in Mathematics #453, 1974.
16. [PN77] Pnueli, A., The Temporal Logic of Programs, 19th Annual Symp. on Foundations of Computer Science, 1977.
17. [PN81] Pnueli, A., The Temporal Logic of Concurrent Programs, Theoretical Computer Science, V13, pp. 45-60, 1981.
18. [PS83] Pnueli, A. and Sherman, R., Personal Communication, 1983.
19. [RA69] Rabin, M., Decidability of Second order Theories and Automata on Infinite Trees, Trans. Amer. Math. Society, vol. 141, pp. 1-35, 1969.
20. [RA70] Rabin, M., Automata on Infinite Trees and the Synthesis Problem, Hebrew Univ., Tech. Report no. 37, 1970.
21. [RA83] Rabin, M., personal communication.
22. [RS59] Rabin, M. and Scott, D., Finite Automata and their Decision Problems, IBM J. Research and Development, vol. 3, pp. 114-125, 1959.
23. [ST81] Streett, R., Propositional Dynamic Logic of Looping and Converse (PhD Thesis), MIT Lab for Computer Science, TR-263, 1981. (a short version appears in STOC81).
24. [Wo82] Wolper, P., A Translation from Full Branching Time Temporal Logic to One Letter Propositional Dynamic Logic with Looping, unpublished manuscript, 1982.
25. [VW83] Vardi, M., and Wolper, P., Yet Another Process Logic, CMU Workshop on Logics of Programs, Springer-Verlag, 1983.