Advertisement

Logic of Programs 1983: Logics of Programs pp 176-192 | Cite as

Deciding branching time logic: A triple exponential decision procedure for CTL

  • E. Allen Emerson
  • A. Prasad Sistla
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)

Keywords

Atomic Proposition State Formula Tree Automaton Propositional Dynamic Logic Infinite Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. Bibliography

  1. [AB80]
    Abrahamson, K., Decidability and Expressiveness of Logics of Processes, PhD Thesis, Univ. of Washington, 1980.Google Scholar
  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.Google Scholar
  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.Google Scholar
  4. [CES83]
    Clarke, E. M., Emerson, E. A., and Sistla, A. P., Automatic Verification of Finite State Concurrent Programs: A Practical Approach, POPL83.Google Scholar
  5. [EC82]
    Emerson, E. A., and Clarke, E. M., Using Branching Time Logic to Synthesize Synchronization Skeletons, Tech. Report TR-208, Univ. of Texas, 1982. (to appear in SCP)Google Scholar
  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.Google Scholar
  7. [EH83]
    Emerson, E. A., and Halpern, J. Y., 'sometimes’ and ‘Not Never’ Revisited: On Branching versus Linear Time. POPL83.Google Scholar
  8. [EM81]
    Emerson, E. A., Alternative Semantics for Temporal Logics, Tech. Report TR-182, Univ. of Texas, 1981. (To appear in TCS)Google Scholar
  9. [FL79]
    Fischer, M. J., and Ladner, R. E, Propositional Dynamic Logic of Regular Programs, JCSS vol. 18, pp. 194–211, 1979.Google Scholar
  10. [GPSS8O]
    Gabbay, D., Pnueli, A., et al., The Temporal Analysis of Fairness. 7th Annual ACM Symp. on Principles of Programming Languages, 1980.Google Scholar
  11. [LA8O]
    Lamport, L., "Sometimes" is Sometimes "Not Never." 7th Annual ACM Symp. on Principles of Programming Languages, 1980.Google Scholar
  12. [MC66]
    McNaughton, R., Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, vol. 9, 1966.Google Scholar
  13. [PN77]
    Pnueli, A., The Temporal Logic of Programs, 19th Annual Symp. on Foundations of Computer Science, 1977.Google Scholar
  14. [PN81]
    Pnueli, A., The Temporal Logic of Concurrent Programs, Theoretical Computer Science, V13, pp. 45–60, 1981.Google Scholar
  15. [PS83]
    Pnueli, A. and Sherman, R., Personal Communication, 1983.Google Scholar
  16. [RA69]
    Rabin, M., Decidability of Second order Theories and Automata on Infinite Trees, Trans. Amer. Math. Society, vol. 141, pp. 1–35, 1969.Google Scholar
  17. [RA70]
    Rabin, M., Automata on Infinite Trees and the Synthesis Problem, Hebrew Univ., Tech. Report no. 37, 1970.Google Scholar
  18. [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)Google Scholar
  19. [Wo82]
    Wolper, P., A Translation from Full Branching Time Temporal Logic to One Letter Propositional Dynamic Logic with Looping, unpublished manuscript, 1982.Google Scholar
  20. [VW82]
    Vardi, M., and Wolper, P., Yet Another Process Logic, this workshop, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • E. Allen Emerson
    • 1
  • A. Prasad Sistla
    • 2
  1. 1.Computer Sciences DepartmentUniversity of TexasAustin
  2. 2.Aiken Computation LabHarvard UniversityCambridge

Personalised recommendations