Skip to main content
SpringerLink
Log in

Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends

  • Chapter
  • First Online:
Current Trends in Concurrency

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 224))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.A. Ashcroft — Proving Assertions about Parallel Programs, JCSS 10,1 (1975) 110–135.

    Google Scholar 

  2. K.R. Apt, N. Francez, W.P. DeRoever — A Proof System for Communicating Sequential Processes, TOPLAS 2 (1980) 359–385.

    Google Scholar 

  3. E. Ashcroft, Z. Manna — Formalization of Properties of Parallel Programs, Machine Intelligence 6, B. Meltzer, D. Michie, Eds., Edinburgh (1971) 17–41.

    Google Scholar 

  4. K.R. apt, E.-R. Olderog — Proof Rules and Transformations dealing with Fairness, Science of Computer Programming 3 (1983) 65–100.

    Google Scholar 

  5. B. Alpern, F. Schneider — Defining Liveness, Cornell University (1984).

    Google Scholar 

  6. H. Barringer, R. Kuiper, A. Pnueli — Now You May Compose Temporal Logic Specifications, Proc. 16th ACM Symp. on Theory of Computing (1984) 51–63.

    Google Scholar 

  7. K.A. Bartlett, R.A. Scantlebwy, P.T. Wilkinson — A Note on Reliable Full-Duplex Transmissions over Half-Duplex Links, CACM 12,5 (1969) 260–261.

    Google Scholar 

  8. J.R. Buchi — Weak Second Order Arithmetic and Finite Automata, Zeithschrift fur Math. Log. und Grundl. der Math. 6 (1960) 66–92.

    Google Scholar 

  9. M. Chandy — Concurrent Programming for the Masses, 4th ACM Symp. on Principles of Distributed Computing (1985) 1–12.

    Google Scholar 

  10. E.M. Clarke, E.A. Emerson — Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic, Proc. Workshop on Logics of Programs, LNCS 131 (1981) 52–71.

    Google Scholar 

  11. O. Grumberg, N. Francez, J. Makowski, W.P. DeRoever — A Proof Rule for Fair Termination of Guarded Commands, Proc. Int. Symp. on Algorithmic Languages (1981) 399–416.

    Google Scholar 

  12. D. Gabbay, A. Pnueli, S. Shelah, J. Stavi — On the Temporal Analysis of Fairness, 7th ACM Symp. on Principles of Programming Languages (1980) 163–173.

    Google Scholar 

  13. B. Hailpern — Verifying Concurrent Processes Using Temporal Logic, Logic, LNCS 129 (1982).

    Google Scholar 

  14. C.A.R. Hoare — Communicating Sequential Processes, Comm. ACM 21,8 (1978) 666–676.

    Google Scholar 

  15. B. Hailpern, S. Owicki — Modular Verification of Computer Communication Protocols, IEEE Trans. on Communication COM-31 1 (1983) 56–68.

    Google Scholar 

  16. M. Hennesy, G.A. Plotkin — A Term Model for CCS, Mathematical Foundations of Computer Science, LNCS 88 (1980) 261–274.

    Google Scholar 

  17. J.E. Hopcroft, J.D. Ullman — Introduction to Automata Theory, Languages, and Computation, Addison Wesley (1979).

    Google Scholar 

  18. H.W. Kamp — Tense Logic and the Theory of Linear Order, Ph.D. Thesis, UCLA (1968).

    Google Scholar 

  19. R. Kuiper, W.P. DeRoever — Fairness Assumptions for CSP in a Temporal Logic Framework, Proc. IFIP Working Conference on Formal Descriptions of Programming Concepts II (1982) 127–134.

    Google Scholar 

  20. R. Koymans, J. Vytopil, W.P. DeRoever — Real Time Programming and Asynchronous Message Passing, 2nd ACM Symp. on Principles of Distributed Programming (1983) 187–197.

    Google Scholar 

  21. L. Lamport — Proving the Correctness of Multiprocess Programs, IEEE Trans. Software Engineering SE-3,2 (1977) 125–143.

    Google Scholar 

  22. L. Lamport — What Good is Temporal Logic? Proceedings of IFIP North Holland (1983) 657–668.

    Google Scholar 

  23. L. Lamport — Specifying Concurrent Program Modules, TOPLAS 5,2 (1983) 190–222.

    Google Scholar 

  24. O. Lichtenstein, A. Pnueli, L. Zuck — The Glory of the Past, Logics of Programs, LNCS (1985).

    Google Scholar 

  25. R. Milner — A Calculus of Communicating Systems, LNCS 92 (1980).

    Google Scholar 

  26. R. McNaughton, S. Papert — Counter Free Automata, MIT Press, Cambridge, Mass. (1971).

    Google Scholar 

  27. Z. Manna, A. Pnueli — The Temporal Framework for Concurrent Programs, in The Correctness Problem in Computer Science, R.S. Boyer, J.S. Moore, eds., Academic Press (1981) 215–274.

    Google Scholar 

  28. Z. Manna, A. Pnueli — How to Cook a Temporal Proof System for your Pet Language, Proc. 10th ACM POPL (1983).

    Google Scholar 

  29. Z. Manna, A. Pnueli — Proving Precedence Properties: the Temporal Way, Automata Languages and Programming, 10th Colloquium, LNCS 154 (1983) 491–512.

    Google Scholar 

  30. Z. Manna, A. Pnueli — Verification of Concurrent Programs: A Temporal Proof System, Foundations of Computer Science IV, J.W. Debakker, J. Van Leeuwen, Eds., Mathematical Center Tracts 159, Amsterdam (1983) 163–255.

    Google Scholar 

  31. Z. Manna, A. Pnueli — Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs, Science of Computer Programming 4 (1984) 257–289.

    Google Scholar 

  32. V. Nguyen, D. Gries, S. Owicki — A Model and Temporal Proof System for Network of Processes, 12th ACM Symp. Principles of Programming Languages (1985) 121–131.

    Google Scholar 

  33. S. Owicki, D. Gries — An Axiomatic Proof Technique for Parallel Programs, Acta Informatica 6 (1976) 319–340.

    Google Scholar 

  34. S. Owicki, L. Lamport — Proving Liveness Properties of Concurrent Programs, ACM TOPLAS 4,3 (1982) 455–495.

    Google Scholar 

  35. G.L. Peterson — Myths about the Mutual Exclusion Problem, Information Processing Letters 12,3 (1981) 115–116.

    Google Scholar 

  36. A. Pnueli — The Temporal Logic of Programs, in 18th IEEE Symp. Foundations of Computer Science (1977) 46–57.

    Google Scholar 

  37. A. Pnueli — In Transition from Global to Modular Temporal Reasoning about Programs, in Logics and Models of Concurrent Systems, K.R. Apt, Ed., Springer-Verlag (1985) 123–144.

    Google Scholar 

  38. J.P. Queille, J. Sifakis — Fairness and Related Properties in Transition Systems — A Temporal Logic to deal with Fairness, Acta Informatica 19 (1983) 195–220.

    Google Scholar 

  39. A.P. Sistla — Characterization of Safety and Liveness Properties in Temporal Logic, University of Massachusetts at Amherst.

    Google Scholar 

  40. A.P. Sistla, E.M. Clarke, N. Francez, A.R. Meyer — Can Message Buffers be Axiomatized in Linear Temporal Logic? Information and Control 63,1 (1984) 88–112.

    Google Scholar 

  41. R.L. Schwartz, P.M. Melliar-Smith — From State Machines to Temporal Logic: Specification Methods for Protocol Standards, IEEE Trans. on Communication COM-30,12 (1982) 2486–2496.

    Google Scholar 

  42. W. Thomas — A Combinatorial Approach to the Theory of ω-Automata, Information and Control 48,3 (1981) 261–283.

    Google Scholar 

  43. P. Wolper — Temporal Logic can be More Expressive, Information and Control 56, 1–2 (1983) 72–93.

    Google Scholar 

  44. P. Wolper — Expressing Interesting Properties of Programs in Propositional Temporal Logic, 13th ACM Symp. Principles of Programming Languages (1986) 184–193.

    Google Scholar 

  45. L. Zuck — Verification of Probabilistic Programs, Ph.D. Thesis, Weizmann Institute (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, The Weizmann Institute of Science, 76100, Rehovot, Israel

    A. Pnueli

Authors
  1. A. Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pnueli, A. (1986). Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Current Trends in Concurrency. Lecture Notes in Computer Science, vol 224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027047

Download citation

  • DOI: https://doi.org/10.1007/BFb0027047

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16488-3

  • Online ISBN: 978-3-540-39827-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation