We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 4 Issue 4
October  1989
Turn off MathJax
Article Contents
Abstract
References
Liu Zhiming. A Continuous Algebraic Semantics of CSP[J]. Journal of Computer Science and Technology, 1989, 4(4): 304-314.
Citation: Liu Zhiming. A Continuous Algebraic Semantics of CSP[J]. Journal of Computer Science and Technology, 1989, 4(4): 304-314.
shu

A Continuous Algebraic Semantics of CSP

  • Institute of Software, Academia Sinica

More Information
  • Received Date: August 10, 1987
  • Revised Date: November 10, 1987
    Abstract
  • This is an attempt to use continuous 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.
    • FullText(HTML)
    • References (14)
  • [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.
    [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.
    [5]
    M. Broy and M. Wirsing, A systematic study of models of abstract data types, Theoretical Computer Science,33 (1984), 139-174.
    [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.
    [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.
    • Relative Articles
  • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (8) PDF downloads (0) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return