Skip to main content
SpringerLink
Log in

Temporal logic with fixed points

  • Collected Papers
  • Conference paper
  • First Online:
Temporal Logic in Specification

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

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. H. Barringer, R. Kuiper, and A. Pnueli. Now You May Compose Temporal Logic Specifications. In Proceedings of the Sixteenth ACM Symposium on the Theory of Computing, 1984.

    Google Scholar 

  2. H. Barringer, R. Kuiper, and A. Pnueli. A compositional temporal approach to a csp-like language. In E. J. Neuhold and G. Chroust, editors, Formal Models of Programming, pages 207–227. IFIP, North-Holland, 1985.

    Google Scholar 

  3. H. Barringer, R. Kuiper, and A. Pnueli. A Really Abstract Concurrent Model and its Temporal Logic. In Proceedings of the Thirteenth ACM Symposium on the Principles of Programming Languages, St. Petersberg Beach, Florida, January 1986.

    Google Scholar 

  4. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications: A Practical Approach. In Proceedings of the Tenth ACM Symposium on the Principles of Programming Languages, 1983.

    Google Scholar 

  5. L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2):190–222, July 1983.

    Google Scholar 

  6. Z. Manna and A. Pnueli. Verification of Concurrent Programs: The Temporal Framework. In Robert S. Boyer and J. Strother Moore, editors, The Correctness Problem in Computer Science. Academic Press, London, 1981.

    Google Scholar 

  7. R. Rosner. A Choppy Logic. Master's thesis, Department of Computer Science, The Weizmann Institute of Science, 1985.

    Google Scholar 

  8. A. P. Sistla and E. M. Clarke. The Complexity of Propositional Linear Temporal Logics. ACM Journal, 32(3):733–749, July 1985.

    Google Scholar 

  9. A. Sistla, E. M. Clarke, N. Francez, and Y. Gurevich. Can message buffers be characterised in linear temporal logic, 1982.

    Google Scholar 

  10. A. Tarski. A Lattice-theoretical Fixedpoint Theorem and its Appplications. Pacific Journal of Mathematics, 5:285–309, 1955.

    Google Scholar 

  11. Moshe Y. Vardi. A Temporal Fixpoint Calculus. In Proceedings of the Fifteenth ACM Symposium on the Principles of Programming Languages, pages 250–259, San Diego, California, January 1988. (Extended Abstract).

    Google Scholar 

  12. P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.

    Google Scholar 

  13. P. Wolper. Temporal Logic Can Be More Expressive. Information and Control, 56, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, Manchester

    Behnam Banieqbal & Howard Barringer

Authors
  1. Behnam Banieqbal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Howard Barringer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Banieqbal H. Barringer A. Pnueli

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Banieqbal, B., Barringer, H. (1989). Temporal logic with fixed points. In: Banieqbal, B., Barringer, H., Pnueli, A. (eds) Temporal Logic in Specification. Lecture Notes in Computer Science, vol 398. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51803-7_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-51803-7_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51803-7

  • Online ISBN: 978-3-540-46811-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation