Skip to main content
SpringerLink
Log in

A continuous algebraic semantics of CSP

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This is an attempt to use continous algebras to describe the semantics of CSP—continuity being used to solve recursive definitions of processes as infinite objects. By so doing, we combine the algebraic specifications of abstract data types with CSP to make up 2 new language, which is recommended as a promising candidate of specification language for designing and developing communicating systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. A. Goguen, J. W. Thatcher and E. G. Wagener, An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types,in Current Trends in Programming Methodology,4 (1978), 80–194.

  2. J. A. Goguen, J. W. Thatcher, E. G. Wagener and J. B. Wright, Initial algebra semantics and continuous algebras,J. ACM,24 (1977).

  3. S. L. Bloom, Varieties of ordered algebras,Journal of Computer and System Sciences,13 (1979), 200–212.

    MathSciNet  Google Scholar 

  4. R. M. Burstall and J. A. Goguen, Putting theories together to make specifications, Proc. Fifth Int’l Joint Conf. on Artificial Intelligence, 2 (1977), 1045–1058.

    Google Scholar 

  5. M. Broy and M. Wirsing, A systematic study of models of abstract data types,Theoretical Computer Science,33 (1984), 139–174.

    Article  MATH  MathSciNet  Google Scholar 

  6. C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, International Series in Compter Science.

  7. International Standardization Organization, LOTOS—A Formal description Technique Based on the Temporal Ordering of Observational Behaviour, Draft Proposal ISO/OP 8807, 1985.

  8. R. Milner, A Calculus of Communicating Systems, Leture Notes in Computer Science 92 (1979).

  9. M. J. O Donnell, Computing in Systems Described by Equations, Lecture Notes in Computer Science 58.

  10. Udo Pletat, Algebraic Specifications of Abstract Data Types and CCS: An Operational Junction, Proc. 6th IFIP Int’l Workshop on Protocol Specification, Testing and Verification, Montreal, June 1986.

  11. M. Wirsing, P. Peper, H. Partsh, W. Dosech and M. Broy, On hierarchies of abstract data types, Acta Informatica,20 (1983), 1–33.

    Article  MATH  MathSciNet  Google Scholar 

  12. Zhou Chaochen, Specifying Communicating Systems with Temporal Logic, Lecture Notes at the Technical University of Denmark, Jan. 1986.

  13. Zhou Chaochen, A Temporal Semantics of Communicating Processes, Proc. of PPCC—I, 1985, Melbourne, Australia, 617–630.

  14. Zhou Chaochen, A study of communicating sequential processes,Chinese Journal of Computers,6:1 (1983), 1–8.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Software, Academia Sinica, Beijing, China

    Liu Zhiming

Authors
  1. Liu Zhiming
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Z. A continuous algebraic semantics of CSP. J. of Comput. Sci. & Technol. 4, 304–314 (1989). https://doi.org/10.1007/BF02943112

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation