Revisiting Sequential Composition in Process Calculi
Journal of Logical and Algebraic Methods in Programming, 84(6), pages 742-762, November 2015
The article reviews the various ways sequential composition is defined in traditional process calculi, and shows that such definitions are not optimal, thus limiting the dissemination of concurrency theory ideas among computer scientists. An alternative approach is proposed, based on a symmetric binary operator and write-many variables. This approach, which generalizes traditional process calculi, has been used to define the new LNT language implemented in the CADP toolbox. Feedback gained from university lectures and real-life case studies shows a high acceptance by computer-science students and industry engineers.
|Slides of H. Garavel's lecture|