J. C. M. Baeten (2005):
A Brief History of Process Algebra.
Theor. Comput. Sci. 335(2-3),
pp. 131–146,
doi:10.1016/j.tcs.2004.07.036.
E. Brinksma (1985):
A tutorial on LOTOS.
In: Proc. of PSTV,
pp. 171–194.
S. D. Brookes (1983):
On the Relationship of CCS and CSP.
In: Proc. of ICALP,
LNCS 154,
pp. 83–96,
doi:10.1007/BFb0036899.
H. Evrard & F. Lang (2015):
Automatic Distributed Code Generation from Formal Models of Asynchronous Concurrent Processes.
In: Proc. of PDP.
IEEE,
pp. 459–466,
doi:10.1109/PDP.2015.96.
R. van Glabbeek (2012):
Musings on Encodings and Expressiveness.
In: Proc. of EXPRESS/SOS,
EPTCS 89,
pp. 81–98,
doi:10.4204/EPTCS.89.7.
D. Gorla (2010):
Towards a Unified Approach to Encodability and Separation Results for Process Calculi.
Information and Computation 208(9),
pp. 1031–1053,
doi:10.1016/j.ic.2010.05.002.
M. Hatzel, C. Wagner, K. Peters & U. Nestmann (2015):
Encoding CSP into CCS (Extended Version).
Technical Report.
Available at http://arxiv.org/abs/1508.01127.
C. A. R. Hoare (1978):
Communicating Sequential Processes.
Communications of the ACM 21(8),
pp. 666–677,
doi:10.1145/359576.359585.
C. A. R. Hoare (2006):
Why ever CSP?.
Electronic Notes in Theoretical Computer Science 162(0),
pp. 209–215,
doi:10.1016/j.entcs.2006.01.031.
I. Lanese & U. Montanari (2006):
Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility.
Electronic Notes in Theoretical Computer Science 154(2),
pp. 55 – 72,
doi:10.1016/j.entcs.2005.03.032.
R. Milner (1980):
A calculus of communicating systems.
Springer,
doi:10.1007/3-540-10235-3.
R. Milner (1986):
Process Constructors and Interpretations (Invited Paper).
In: IFIP Congress,
pp. 507–514.
R. Milner & D. Sangiorgi (1992):
Barbed Bisimulation.
In: Proc. of ICALP,
LNCS 623,
pp. 685–695,
doi:10.1007/3-540-55719-9_114.
U. Nestmann (1996):
On Determinacy and Nondeterminacy in Concurrent Programming.
Universität Erlangen-Nürnberg.
U. Nestmann & B. C. Pierce (2000):
Decoding Choice Encodings.
Information and Computation 163(1),
pp. 1–59,
doi:10.1006/inco.2000.2868.
J. Parrow & P. Sjödin (1992):
Multiway synchronization verified with coupled simulation.
In: Proc. of CONCUR,
LNCS 630.
Springer,
pp. 518–533,
doi:10.1007/bfb0084813.
K. Peters (2012):
Translational Expressiveness.
TU Berlin.
K. Peters & R. van Glabbeek (2015):
Analysing and Comparing Encodability Criteria.
In: Proc. of EXPRESS/SOS,
Electronic Proceedings in Theoretical Computer Science 190,
pp. 46-60,
doi:10.4204/EPTCS.190.4.
Open Publishing Association.
K. Peters & U. Nestmann (2012):
Is it a ``Good'' Encoding of Mixed Choice?.
In: Proc. of FoSSaCS,
LNCS 7213,
pp. 210–224,
doi:10.1007/978-3-642-28729-9_14.
K. Peters, U. Nestmann & U. Goltz (2013):
On Distributability in Process Calculi.
In: Proc. of ESOP,
LNCS 7792.
Springer,
pp. 310–329,
doi:10.1007/978-3-642-37036-6_18.
P. Sjödin (1991):
From LOTOS Specifications to Distributed Implementations.
Department of Computer Science, Uppsala University.
Available as Report DoCS 91/31.