Skip to main content
SpringerLink
Log in

Infinitary parallelism without unbounded nondeterminism in CSP

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The theory of CSP is extended to include an infinitary parallel composition operator. The presence of such an operator allows us to write programs where infinitely many agents compute concurrently. We show that this operator can be modelled within the failures-divergences model of Brookes and Roscoe. The operator is continuous in each of its arguments, and in fact preserves the limits of almost all chains in the infinitary product c.p.o. We also demonstrate that this operator adds to the expressive power of CSP. A comparison of this operator with that defined by Barrett [1] is also provided.

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.

Similar content being viewed by others

References

  1. Barrett, G.: The fixed point theory of unbounded non-determinism. Formal Aspects Comput.3, 110–128 (1991)

    Google Scholar 

  2. Barrett, G.: Personal communication

  3. Brookes, S., Roscoe, A.W.: An improved failures model for communicating sequential processes. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.) Seminar on concurrency. Proceedings 1985. (Lect. Notes Comput. Sci., vol. 197, pp. 280–305) Berlin, Heidelberg, New York: Springer 1990

    Google Scholar 

  4. Brookes, S., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM31, 560–599 (1984)

    Google Scholar 

  5. Hoare, C.A.R.: Communicating sequential processes. Englewood Cliffs, NJ: Prentice Hall 1985

    Google Scholar 

  6. Narayan Kumar, K., Pandya, P.K.: Infinitary parallelism without unbounded nondeterminism in CSP. Technical Report No. CS-92/3. Computer Science Group, TIFR. Bombay 1992

    Google Scholar 

  7. Roscoe, A.W.: Two papers on CSP. PRG-TR-67-88. Programming Research Group, Oxford University 1988

  8. Sridhar, K.T., Hoare, C.A.R.: JSD expressed in CSP. In: Cameron, J. (ed.) JSP and JSD: The Jackson approach to software development, 2nd edn. New York: IEEE Computer Society Press 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, 400 005, Bombay, India

    K. Narayan Kumar & Paritosh K. Pandya

Authors
  1. K. Narayan Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paritosh K. Pandya
    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

Kumar, K.N., Pandya, P.K. Infinitary parallelism without unbounded nondeterminism in CSP. Acta Informatica 30, 467–487 (1993). https://doi.org/10.1007/BF01210597

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation