References

1. C. Bodei, P. Degano & C. Priami (2005): Checking security policies through an enhanced Control Flow Analysis. Journal of Computer Science 13(1), pp. 49–85.
2. M. Carbone & S. Maffeis (2003): On the Expressive Power of Polyadic Synchronisation in the π-calculus. Nordic Journal of Computing 10(2), pp. 70–98.
3. L. Cardelli & A.D. Gordon (2000): Mobile ambients. Theoretical Computer Science 240(1), pp. 177–213, doi:10.1016/S0304-3975(99)00231-5.
4. M. Giunti (2013): Algorithmic type checking for a pi-calculus with name matching and session types. The Journal of Logic and Algebraic Programming 82(8), pp. 263–281, doi:10.1016/j.jlap.2013.05.003.
5. D. Gorla (2010): A taxonomy of process calculi for distribution and mobility. Distributed Computing 23(4), pp. 273–299, doi:10.1007/s00446-010-0120-6.
6. 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.
7. D. Gorla & U. Nestmann (2014): Full Abstraction for Expressiveness: History, Myths and Facts. Mathematical Structures in Computer Science. To appear..
8. R. Milner (1999): Communicating and Mobile Systems: The π-Calculus. Cambridge University Press.
9. 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, 10.1016/0890-5401(92)90009-5.
10. R. Milner & D. Sangiorgi (1992): Barbed Bisimulation. In: Proceedings of ICALP, LNCS 623. Springer, pp. 685–695, doi:10.1007/3-540-55719-9_114.
11. C. Palamidessi (2003): Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus. Mathematical Structures in Computer Science 13(5), pp. 685–719, doi:10.1145/263699.263731.
12. J. Parrow (2008): Expressiveness of Process Algebras. Electronic Notes in Theoretical Computer Science 209, pp. 173–186, doi:10.1016/j.entcs.2008.04.011.
13. K. Peters (2012): Translational Expressiveness. PhD. Technische Universit\begingroupłet [Pleaseinsert\PrerenderUnicodeäintopreamble]t Berlin.
14. K. Peters & U. Nestmann (2014): Breaking Symmetries. To Appear in Mathematical Structures in Computer Science, doi:10.4204/EPTCS.41.10.
15. 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.
16. K. Peters, T. Yonova-Karbe & U. Nestmann (2014): Matching in the Pi-Calculus (Technical Report). Technical Report. TU Berlin. Available at arXiv.org.
17. I.C.C. Phillips & M.G. Vigliotti (2004): Electoral Systems in Ambient Calculi. In: Proceedings of FoSSaCS, LNCS 2987, pp. 408–422, doi:10.1007/978-3-540-24727-2_29.
18. D. Sangiorgi (1996): A theory of bisimulation for the π-calculus. Acta Informatica 33(1), pp. 69–97, doi:10.1007/s002360050036.
19. D. Sangiorgi & D. Walker (2001): The π-calculus: A Theory of Mobile Processes. Cambridge University Press.
20. J.L.F. Vivas (2001): Dynamic Binding of Names in Calculi for Mobile Processes. PhD. Royal Institute of Technology, Sweden.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org