Skip to main content
SpringerLink
Log in

Temporal logics for CCS

  • Technical Contributions
  • Conference paper
  • First Online:
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (REX 1988)

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

Abstract

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.

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. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science 92 (Springer, Berlin, 1980).

    Google Scholar 

  2. A. Pnueli, Specification and development of reactive systems, Information Processing 86 (Elseiver Science Publishers, North-Holland, 1986) 845–858.

    Google Scholar 

  3. J. Sifakis, A unified approach for studying the properties of transition systems, Theoretical Computer Science 18 (1982) 227–258.

    Article  Google Scholar 

  4. M. Hennessy, Axiomatizing finite delay operators, Acta. Inform. 21 (1984), 61–88.

    Article  Google Scholar 

  5. D. Walker, Bisimulations and divergence, 3rd Symposium on Logic in Computer Science (Computer Science Press, Washington, 1988) 186–192.

    Google Scholar 

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

    Google Scholar 

  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. E. Emerson and E. Clarke, Using branching time logic to synthesize synchronization skeletons, Sci. Comput. Programming 2 (1982) 241–266.

    Article  Google Scholar 

  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. 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. P. Wolper, Temporal logic can be more expressive, Inform. and Control 56 (1983) 72–93.

    Article  Google Scholar 

  12. V. Pratt, A decidable mu-calculus, 22nd ACM Foundations of Computer Science (1981) 421–427.

    Google Scholar 

  13. D. Kozen, Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 333–354.

    Article  Google Scholar 

  14. K. Larsen, Proof systems for Hennessy-Milner logic with recursion, in Proceedings CAAP (1988).

    Google Scholar 

  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. 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. S. Abramsky, Observational equivalence as a testing equivalence. Theoret. Comput. Sci. 53 (1987) 225–241.

    Article  Google Scholar 

  18. J. Van Bentham, Correspondence theory, in Vol II of Handbook of Philosophical Logic, (Reidel D., 1984) 167–247.

    Google Scholar 

  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. M. Hennessy and C. Stirling, The power of the future perfect in program logics, Inform. and Control 67 (1985) 23–52.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, The King's Buildings, EH9 3JZ, Edinburgh

    Colin Stirling

Authors
  1. Colin Stirling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stirling, C. (1989). Temporal logics for CCS. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. REX 1988. Lecture Notes in Computer Science, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013039

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation