Editing Communicating sequential processes (section)

=== Development into process algebra ===

Following the publication of the original version of CSP, Hoare, Stephen Brookes, and [[Bill Roscoe|A. W. Roscoe]] developed and refined the ''theory'' of CSP into its modern, process algebraic form. The approach taken in developing CSP into a process algebra was influenced by [[Robin Milner]]'s work on the [[Calculus of Communicating Systems]] (CCS) and conversely. The theoretical version of CSP was initially presented in a 1984 article by Brookes, Hoare, and Roscoe,<ref>{{cite journal |first1=Stephen |last1=Brookes |author2-link=C. A. R. Hoare |first2=C. A. R. |last2=Hoare |author3-link=Bill Roscoe |author3-first=A. W. |author3-last=Roscoe |title=A Theory of Communicating Sequential Processes |journal=[[Journal of the ACM]] |volume=31 |issue=3 |pages=560–599 |date=1984 |doi=10.1145/828.833 |s2cid=488666 |doi-access=free}}</ref> and later in Hoare's book ''Communicating Sequential Processes'',<ref name="hoare" /> which was published in 1985. In September 2006, that book was still the [http://citeseer.ist.psu.edu/articles.html third-most cited] [[computer science]] reference of all time according to [[Citeseer]]{{Citation needed|date=November 2018}} (albeit an unreliable source due to the nature of its sampling). The theory of CSP has undergone a few minor changes since the publication of Hoare's book. Most of these changes were motivated by the advent of automated tools for CSP process analysis and verification. Roscoe's ''The Theory and Practice of Concurrency''<ref name="roscoe" /> describes this newer version of CSP.