Advertisement

An introduction to modal and temporal logics for CCS

  • Colin Stirling
Part I: Theoretical Aspects Of Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 491)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Bradfield and C. Stirling. Verifying temporal properties of processes. To appear in Proc. Concur 1990.Google Scholar
  2. [2]
    R. Cleaveland, J. Parrow, and B. Steffen. The concuurency workbench. Proc. IFIP, 1989.Google Scholar
  3. [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. [4]
    E. Emerson and J. Srinivasan. Branching time temporal logic. Lect. Notes in Computer Science 354, Springer, 1989.Google Scholar
  5. [5]
    M. Hennessy and R. Milner. On observing nondeterminism and concurrency. Lect. Notes in Computer Science 85, Springer, 1980.Google Scholar
  6. [6]
    M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32, 137–161, 1985.Google Scholar
  7. [7]
    D. Kozen. Results on the propositional mu-calculus. Theoret. Computer Science 27, 1983.Google Scholar
  8. [8]
    K. Larsen. Proof systems for Hennessy-Milner logic with recursion. Lect. Notes in Computer Science 299, Springer, 1988Google Scholar
  9. [9]
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  10. [10]
    Z. Manna and A. Pnueli. The anchored version of the temporal framework. Lect. Notes in Computer Science 354, Springer, 1989.Google Scholar
  11. [11]
    V. Pratt. A decidable mu-calculus. Proc. 22nd IEEE Found. of Computer Science, 1981.Google Scholar
  12. [12]
    C. Stirling. Temporal logics for CCS. Lect. Notes in Computer Science 354, Springer, 1989.Google Scholar
  13. [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. [14]
    D. Walker. Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing 1, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Colin Stirling
    • 1
  1. 1.Dept. of Computer ScienceUniversity of EdinburghEdinburghUK

Personalised recommendations