J. Bengtson, M. Johansson, J. Parrow & B. Victor (2009):
Psi-calculi: Mobile Processes, Nominal Data, and Logic.
In: Proceedings of LICS.
IEEE,
pp. 39–48,
doi:10.1109/LICS.2009.20.
N. Busi, M. Gabbrielli & G. Zavattaro (2009):
On the expressive power of recursion, replication and iteration in process calculi.
Mathematical Structures in Computer Science 19(6),
pp. 1191–1222,
doi:10.1017/S096012950999017X.
D. Cacciagrano, F. Corradini, J. Aranda & F.D. Valencia (2008):
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus.
Electronic Notes in Theoretical Computer Science 194(2),
pp. 59–84,
doi:10.1016/j.entcs.2007.11.006.
L. Cardelli & A. D. Gordon (2000):
Mobile ambients.
Theoretical Computer Science 240(1),
pp. 177–213,
doi:10.1016/S0304-3975(99)00231-5.
R. J. van Glabbeek (2001):
The Linear Time – Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes.
Handbook of Process Algebra,
pp. 3–99,
doi:10.1016/B978-044482830-9/50019-9.
R. J. van Glabbeek (1994):
On the expressiveness of ACP (extended abstract).
In: Proceedings of ACP,
Workshops in Computing.
Springer,
pp. 188–217,
doi:10.1007/978-1-4471-2120-6_8.
R.J. van Glabbeek (2012):
Musings on Encodings and Expressiveness.
In: Proceedings 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.
D. Gorla & U. Nestmann (2014):
Full abstraction for expressiveness: history, myths and facts.
Mathematical Structures in Computer Science,
pp. 1–16,
doi:10.1017/S0960129514000279.
M. Hatzel, C. Wagner, K. Peters & U. Nestmann (2015):
Encoding CSP into CCS.
In: Proceedings of EXPRESS/SOS,
Electronic Proceedings in Theoretical Computer Science 190,
pp. 61-75,
doi:10.4204/EPTCS.190.5.
Open Publishing Association.
R. Milner, J. Parrow & D. Walker (1992):
A Calculus of Mobile Processes, Part I and II.
Information and Computation 100(1),
pp. 1–77,
doi:10.1016/0890-5401(92)90008-4.
J. C. Mitchell (1993):
On abstraction and the expressive power of programming languages.
Science of Computer Programming 21(2),
pp. 141–163,
doi:10.1016/0167-6423(93)90004-9.
U. Nestmann (2000):
What is a ``Good'' Encoding of Guarded Choice?.
Information and Computation 156(1-2),
pp. 287–319,
doi:10.1006/inco.1999.2822.
U. Nestmann (2006):
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi.
In: Proceedings of CONCUR,
LNCS 4137.
Springer,
pp. 52–63,
doi:10.1007/11817949_4.
U. Nestmann & B. C. Pierce (2000):
Decoding Choice Encodings.
Information and Computation 163(1),
pp. 1–59,
doi:10.1006/inco.2000.2868.
T. Nipkow, L. C. Paulson & M. Wenzel (2002):
Isabelle/HOL: a proof assistant for higher-order logic 2283.
Springer Science & Business Media,
doi:10.1007/3-540-45949-9_1.
C. Palamidessi (2003):
Comparing The Expressive Power Of The Synchronous And Asynchronous Pi-Calculi.
Mathematical Structures in Computer Science 13(5),
pp. 685–719,
doi:10.1017/S0960129503004043.
C. Palamidessi, V. A. Saraswat, F. D. Valencia & B. Victor (2006):
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus.
In: Proceedings of LICS.
IEEE Computer Society,
pp. 59–68,
doi:10.1109/LICS.2006.39.
J. Parrow (2008):
Expressiveness of Process Algebras.
Electronic Notes Theoretical Computer Science 209,
pp. 173–186,
doi:10.1016/j.entcs.2008.04.011.
J. Parrow (2014):
General conditions for full abstraction.
Mathematical Structures in Computer Science,
pp. 1–3,
doi:10.1017/S0960129514000280.
J. Parrow & P. Sjödin (1992):
Multiway synchronization verified with coupled simulation.
In: Proceedings of CONCUR,
LNCS 630.
Springer,
pp. 518–533,
doi:10.1007/BFb0084813.
J. A. Perez (2009):
Higher-Order Concurrency: Expressiveness and Decidability Results.
Ph.d. thesis.
University of Bologna.
K. Peters & U. Nestmann (2012):
Is it a ``Good'' Encoding of Mixed Choice?.
In: Proceedings of FOSSACS,
LNCS 7213.
Springer,
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: Proceedings of ESOP,
LNCS 7792.
Springer,
pp. 310–329,
doi:10.1007/978-3-642-37036-6_18.
J. G. Riecke (1991):
Fully abstract translations between functional languages.
In: Proceedings of POPL.
ACM,
pp. 245–254,
doi:10.1145/99583.99617.