Skip to main content
SpringerLink
Log in

Safety, liveness and fairness in temporal logic

  • Published:
Formal Aspects of Computing

Abstract

In this paper we present syntactic characterization of temporal formulas that express various properties of interest in the verification of concurrent programs. Such a characterization helps us in choosing the right techniques for proving correctness with respect to these properties. The properties that we consider include safety properties, liveness properties and fairness properties. We also present algorithms for checking if a given temporal formula expresses any of these properties.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alpern, B., Deemers, A.J. and Schneider, F.B.: Safety without Stuttering, Information Processing Letters 23(4):177–180.

  2. Alpern, B. and Schneider, F.: Defining Liveness, Information Processing Letters, 21:181–185.

  3. Alpern, B. and Schneider, F.B.: Recognizing Safety and Liveness, TR 86-727, Computer Science Department, Cornell University, Jan 1986.

  4. Clarke, E.M., Emerson, E.A. and Sistla, A.P.: Automatic Verification of finite-state Concurrent Systems using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems 8(2):244–263.

  5. Emerson, E.A.: Alternative Semantics for Temporal Logic, Theoretical Computer Science, Vol 26, pp 121–130, 1983.

    Google Scholar 

  6. Emerson, E.A. and Lei, C.L.: Modalities for Modelchecking: Branching Time Strikes Back, Science of Computer Programming, Vol 8, pp 275–306, 1987.

    Google Scholar 

  7. Francez, N.: Fairness, Texts and Monographs in Computer Science, Springer-Verlag 1986.

  8. Lamport, L.: 1977 Proving Correctness of Multiprocess Programs, IEEE Transactions on Software Engineering, SE-3, 2:125–143.

    Google Scholar 

  9. Lamport, L.: Logical Foundation, Distributed Systems-Methods and Tools for Specification, Vol 190, Lecture Notes in Computer Science, Springer-Verlag, Berlin,

  10. Lichtenstein, O., Pnueli, A. and Zuck, L.: The Glory of the Past, Lecture Notes in Computer Science, 193, Proceedings of the workshop on Logics of Programs, Brookline College, June 1985.

  11. Manna, Z. and Pnueli, A.: Completing the Temporal Picture, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, 1989, Also appeared in Theoretical Computer Science, 1991, 83(1):97–130.

    Google Scholar 

  12. Manna, Z. and Pnueli, A.: A hierarchy of Temporal Properties, Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, 1990, pp 377–408.

  13. Manna, Z. and Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems—Specification, Springer-Verlag, 1992.

  14. Owicki, S. Lamport, L.: Proving Liveness Properties of Concurrent Programs, ACM Transactions on Programming Languages and Systems 4,No.3, 1982.

  15. Pnueli, A.: The Temporal Logic of Programs, Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, Providence, RI(1977).

  16. Sistla, A.P., Clarke, E.M., Francez, N. and Meyer, A.R.: Can Message Buffers be Axiomatized in Temporal Logic?, Information and Computation, 63(1,2):88–112.

  17. Sistla, A.P. and Clarke, E.M.: Complexity of Prepositional Temporal Logics, Journal of the Association for Computing Machinery, Vol.32,No.3, July 1985.

  18. Sistla, A.P.: Theoretical Issues in the Design and Verification of Distributed Systems, Ph.D. thesis 1983, Harvard University.

  19. Sistla, A.P.: On Characterization of Safety and Liveness Properties in Temporal Logic, Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, August, 1985, Minaki, Canada.

  20. Sistla, A.P.: Characterization of Safety and Liveness Properties in Temporal Logic, GTE Laboratories Technical Report, 1986.

  21. Thomas, W.: Safety and Liveness Properties in Propositional Temporal Logic: Characterization and Decidability, Schriften Zur Informatik, Bericht Nr. 116. April 1986.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, 60301, Chicago, IL, USA

    A. Prasad Sistla

Authors
  1. A. Prasad Sistla
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is partly supported by NSF grant CCR-9212183. A preliminary version of this paper appeared in the Fourth ACM Symposium on Principles of Distributed Computing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sistla, A.P. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing 6, 495–511 (1994). https://doi.org/10.1007/BF01211865

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation