Skip to main content
SpringerLink
Log in

An introduction to modal and temporal logics for CCS

  • Part I: Theoretical Aspects Of Concurrency
  • Conference paper
  • First Online:
Concurrency: Theory, Language, and Architecture (CONCURRENCY 1989)

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

Included in the following conference series:

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. J. Bradfield and C. Stirling. Verifying temporal properties of processes. To appear in Proc. Concur 1990.

    Google Scholar 

  2. R. Cleaveland, J. Parrow, and B. Steffen. The concuurency workbench. Proc. IFIP, 1989.

    Google Scholar 

  3. E. Emerson and C. Lei. Efficient model checking in fragments of the propositional mu-calculus. Procs. 1st IEEE Symp. on Logic in Computer Science, 1986.

    Google Scholar 

  4. E. Emerson and J. Srinivasan. Branching time temporal logic. Lect. Notes in Computer Science 354, Springer, 1989.

    Google Scholar 

  5. M. Hennessy and R. Milner. On observing nondeterminism and concurrency. Lect. Notes in Computer Science 85, Springer, 1980.

    Google Scholar 

  6. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32, 137–161, 1985.

    Google Scholar 

  7. D. Kozen. Results on the propositional mu-calculus. Theoret. Computer Science 27, 1983.

    Google Scholar 

  8. K. Larsen. Proof systems for Hennessy-Milner logic with recursion. Lect. Notes in Computer Science 299, Springer, 1988

    Google Scholar 

  9. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  10. Z. Manna and A. Pnueli. The anchored version of the temporal framework. Lect. Notes in Computer Science 354, Springer, 1989.

    Google Scholar 

  11. V. Pratt. A decidable mu-calculus. Proc. 22nd IEEE Found. of Computer Science, 1981.

    Google Scholar 

  12. C. Stirling. Temporal logics for CCS. Lect. Notes in Computer Science 354, Springer, 1989.

    Google Scholar 

  13. C. Stirling and D. Walker. Local model-checking in the modal mu-calculus. Lect. Notes in Computer Science 351, Springer, 1989. (Extended version to appear in Theoret. Computer Science)

    Google Scholar 

  14. D. Walker. Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing 1, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Edinburgh, EH9 3JZ, Edinburgh, UK

    Colin Stirling

Authors
  1. Colin Stirling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Akinori Yonezawa Takayasu Ito

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stirling, C. (1991). An introduction to modal and temporal logics for CCS. In: Yonezawa, A., Ito, T. (eds) Concurrency: Theory, Language, and Architecture. CONCURRENCY 1989. Lecture Notes in Computer Science, vol 491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53932-8_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-53932-8_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53932-2

  • Online ISBN: 978-3-540-46452-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation