The reflexive CHAM and the join-calculus
1996pp. 372–385
Citations Over TimeTop 1% of 1996 papers
Abstract
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a programming language with functional and object-oriented features. It can also be seen as a process calculus, the join-calculus, which we prove equivalent to the π-calculus of Milner, Parrow and Walker.
Related Papers
- → Rigid Families for CCS and the $$\pi $$ -calculus(2015)22 cited
- → Higher-Order Concurrency: Expressiveness and Decidability Results(2010)20 cited
- → Timing and causality in process algebra(1996)96 cited
- → An introduction on extensions of process algebra: Concurrent and communicating systems(2012)2 cited
- → On the ill-timed but well-caused(1993)33 cited