The temporal logic of branching time

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1981, Pages 164-176

  Ben Ari, Mordechai ^a   Manna, Zohar ^b   Pnueli, Amir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BRANCHING TIME; DECISION PROCEDURE; DEDUCTION SYSTEMS; GRAPH REPRESENTATION; TABLEAUX METHODS; TEMPORAL LANGUAGE; TEMPORAL OPERATORS; TEMPORAL SEMANTICS;

TEMPORAL LOGIC;

EID: 85037127279     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/567532.567551     Document Type: Conference Paper

References (18)

1. [Al] K.R. Abramson, Modal logic of concurrent nondeterministic programs, Symposium on Semantics of Concurrent Computations, Lecture Notes m Computer Science 70, Springer Verlag, Berlin, 1979-, 21-33.
2. [A2] K.R. Abrahamson, Decidability and Expressiveness of Logic of Processes, Ph.D. Thesis, University of Washington, August 1980.
3. [D] E.W. Dijkstra, Guarded commands, nondeterminancy and formal derivation of programs, C. ACM 18(8), 1975, 453-457.
4. [EC] E.A. Emerson and E.M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, TR-04-80, Aiken Computation Laboratory, Harvard.
5. [F] R.W. Floyd, Nondeterministic algorithms, J. ACM 14(4), 1967, 636-644.
6. [FL] M.J. Fischer and R.E. Ladner, Propo-sitional dynamic logic of regular programs, Journal of Computer and System Sciences 18(2), 1979, 194-211.
7. [GPSS] D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, The temporal analysis of fairness, Seventh ACM Symposium on Principles of Programming Languages, 1980, 163-173.
8. [H] Harel, First Order Dynamic Logic, Lecture Notes m Computer Science 68, Springer-Verlag, Berlin, 1979.
9. [HKP] D. Harel, D. Kozen and R. Parikh, Process logic: expressiveness, decidability, completeness, 21th Symposium on Foundations of Computer Science, 1980.
10. [HC] G.E. Hughes and M.J. Cresswell, An Introduction to Modal Logic, Methuen, London, 1968.
11. [L] L. Lamport, "Sometime" is sometimes "not never", Seventh ACM Symposium on Principles of Programming Languages, 1980, 174-185.
12. [Ml] Z. Manna, Mathematical theory of partial correctness, Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics 188, Springer Verlag, Berlin, 1971, 252-269.
13. [M2] Z. Manna, Second order mathematical theory of computation, Second ACM Symposium on Theory of Computing, 1970, 158-168.
14. [MP] Z. Manna and A. Pnueli, The modeal logic of programs, Automata, Languages and Programming, Lecture Notes in Computer Science 79, Springer-Verlag, Berlin, 1979, 385-409.
15. [PN] A. Pnueli, The temporal semantics of concurrent programs, Symposium on Semantics of Concurrent Computations, Lecture Notes in Computer Science 70, Springer Verlag, 1979, 1-20.
16. [PR] V.R. Pratt, A practical decision method for propositional dynamic logic, Tenth ACM Symposium on Theory of Computing, 1977, 326-337.
17. [RU] N. Rescher and A. Urquhart, Temporal Logic, Springer-Verlag, Vienna, 1971.
18. [S] R.M. Smullyan, First-Order Logic, Springer-Verlag, Berlin, 1968.