An application of the calculus of communicating systems to the prime factorization problem

https://doi.org/10.1016/0950-5849(93)90045-5Get rights and content

Abstract

This case study applies the calculus of communicating systems (CCS) to the problem of decomposing any natural number into its prime factors. It shows that CCS provides an elegant and neat formalism for the specification of concurrent processes. In particular, the application of CCS to problems like primality testing and factorization may yield useful results.

References (6)

  • R Milner

    A calculus of communicating systems

    (1980)
  • R Milner

    Communication and concurrency

    (1989)
  • D Walker

    Introduction to a calculus of communicating systems

There are more references available in the full text version of this article.

Cited by (0)

View full text