Temporal logics for CCS

  • Colin Stirling
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 354)


Transition systems are focal structures in the study of concurrent systems. On the one hand they are used for defining operational semantics of such systems. And on the other hand they are fundamental structures for interpreting modal and temporal logics. Here we consider different transition systems associated with Milner's Calculus of Communicating Systems (CCS), these differ according to how silent actions are treated. Then a general framework for modal and temporal logics is outlined. Within this framework modal and temporal mu-calculi are highlighted, logics that are appropriate for describing CCS processes. Finally, the equivalences induced by these logics on processes is examined, in general terms.


transition systems modal logic temporal logic CCS 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science 92 (Springer, Berlin, 1980).Google Scholar
  2. 2.
    A. Pnueli, Specification and development of reactive systems, Information Processing 86 (Elseiver Science Publishers, North-Holland, 1986) 845–858.Google Scholar
  3. 3.
    J. Sifakis, A unified approach for studying the properties of transition systems, Theoretical Computer Science 18 (1982) 227–258.CrossRefGoogle Scholar
  4. 4.
    M. Hennessy, Axiomatizing finite delay operators, Acta. Inform. 21 (1984), 61–88.CrossRefGoogle Scholar
  5. 5.
    D. Walker, Bisimulations and divergence, 3rd Symposium on Logic in Computer Science (Computer Science Press, Washington, 1988) 186–192.Google Scholar
  6. 6.
    M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach. 32 (1985) 137–161.Google Scholar
  7. 7.
    M. Ben-Ari, Z. Manna and A. Pnueli, The temporal logic of branching time, 8th Ann. ACM Symposium on Principles of Programming Languages (1981) 164–176.Google Scholar
  8. 8.
    E. Emerson and E. Clarke, Using branching time logic to synthesize synchronization skeletons, Sci. Comput. Programming 2 (1982) 241–266.CrossRefGoogle Scholar
  9. 9.
    E. Emerson and J. Halpern, 'sometimes’ and ‘not never’ revisited: on branching versus linear time temporal logic, J. Assoc. Comput. Mach. 33 (1986) 151–178.Google Scholar
  10. 10.
    D. Gabbay, A. Pnueli, A. Shelah and J. Stavi, The temporal analysis of fairness, 7th Ann. ACM Symposium on Principles of Programming Languages (1980) 163–173.Google Scholar
  11. 11.
    P. Wolper, Temporal logic can be more expressive, Inform. and Control 56 (1983) 72–93.CrossRefGoogle Scholar
  12. 12.
    V. Pratt, A decidable mu-calculus, 22nd ACM Foundations of Computer Science (1981) 421–427.Google Scholar
  13. 13.
    D. Kozen, Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 333–354.CrossRefGoogle Scholar
  14. 14.
    K. Larsen, Proof systems for Hennessy-Milner logic with recursion, in Proceedings CAAP (1988).Google Scholar
  15. 15.
    E. Emerson and E. Clarke, Characterizing correctness properties of parallel programs as fixpoints, Lecture Notes in Computer Science 85 (Springer, Berlin, 1981).Google Scholar
  16. 16.
    H. Barringer, R. Kuiper and A. Pnueli, Now you may compose temporal logic specifications, 16th ACM Symposium of the Theory of Computing (1984).Google Scholar
  17. 17.
    S. Abramsky, Observational equivalence as a testing equivalence. Theoret. Comput. Sci. 53 (1987) 225–241.CrossRefGoogle Scholar
  18. 18.
    J. Van Bentham, Correspondence theory, in Vol II of Handbook of Philosophical Logic, (Reidel D., 1984) 167–247.Google Scholar
  19. 19.
    J. Baeten, J. Bergstra and J. Klop, Ready trace semantics for concrete process algebra with priority operator, Report CS-R8517, Centrum voor Wiskunde en Informatica (1985).Google Scholar
  20. 20.
    M. Hennessy and C. Stirling, The power of the future perfect in program logics, Inform. and Control 67 (1985) 23–52.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Colin Stirling
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburgh

Personalised recommendations