References

1. G. Berry & G. Boudol (1990): The Chemical Abstract Machine. In: Proc. of POPL, SIGPLAN-SIGACT, pp. 81–94, doi:10.1145/96709.96717.
2. E. Best & P. Darondeau (2011): Petri Net Distributability. In: Proc. of PSI, LNCS 7162.
3. G. Boudol (1992): Asynchrony and the π-calculus (note). Note. INRIA.
4. L. Cardelli & A.D. Gordon (1998): Mobile ambients. In: Proc. of FoSSaCS, LNCS 1378, pp. 140–155, doi:10.1007/BFb0053547.
5. L. Cardelli & A.D. Gordon (2000): Mobile ambients. Theoretical Computer Science 240(1), pp. 177–213, doi:10.1016/S0304-3975(99)00231-5.
6. S. Conchon & F. Le Fessant (1999): Jocaml: mobile agents for Objective-Caml. In: Proc. of ASA/MA. IEEE, pp. 22–29, doi:10.1109/ASAMA.1999.805390.
7. E.W. Dijkstra (1971): Hierarchical Ordering of Sequential Processes. Acta Informatica 1(2), pp. 115–138, doi:10.1007/BF00289519.
8. C. Fournet & G. Gonthier (1996): The Reflexive CHAM and the Join-Calculus. In: Proc. of POPL, SIGPLAN-SIGACT, pp. 372–385, doi:10.1145/237721.237805.
9. C. Fournet, J.-J. Lévy & A. Schmitt (2000): An Asynchronous, Distributed Implementation of Mobile Ambients. In: Proc. of TCS, LNCS 1872, pp. 348–364, doi:10.1007/3-540-44929-9_26.
10. R. van Glabbeek (2001): The Linear Time – Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes. Handbook of Process Algebra, pp. 3–99.
11. R. van Glabbeek, U. Goltz & J.-W. Schicke (2008): On Synchronous and Asynchronous Interaction in Distributed Systems. In: Proc. of MFCS, LNCS 5162, pp. 16–35, doi:10.1007/978-3-540-85238-4.
12. R. van Glabbeek, U. Goltz & J.-W. Schicke-Uffmann (2012): On Distributability of Petri Nets. In: Proc. of FoSSaCS, LNCS 7213, pp. 331–345, doi:10.1007/978-3-642-28729-9_22.
13. 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.
14. M. Hennessy (2007): A Distributed Pi-Calculus. Cambridge University Press, doi:10.1017/CBO9780511611063.
15. K. Honda & M. Tokoro (1991): An Object Calculus for Asynchronous Communication. In: Proc. of ECOOP, LNCS 512, pp. 133–147, doi:10.1007/BFb0057011.
16. F. Levi & D. Sangiorgi (2003): Mobile Safe Ambients. In: Proc. of TOPLAS 25. ACM, pp. 1–69, doi:10.1145/596980.596981.
17. J.-J. Lévy (1997): Some Results in the Join-Calculus. In: Theoretical Aspects of Computer Software, LNCS 1281, pp. 233–249, doi:10.1007/BFb0014554.
18. 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.
19. R. Milner & D. Sangiorgi (1992): Barbed Bisimulation. In: Proc. of ICALP, LNCS 623, pp. 685–695, doi:10.1007/3-540-55719-9_114.
20. K. Peters (2012): Translational Expressiveness. TU Berlin, doi:10.14279/depositonce-3416.
21. K. Peters & U. Nestmann (2018): On the Distributability of Mobile Ambients (Technical Report). Technical Report. TU Berlin, https://arxiv.org.
22. K. Peters, U. Nestmann & U. Goltz (2013): On Distributability in Process Calculi. In: Proc. of ESOP, LNCS 7792, pp. 310–329, doi:10.1007/978-3-642-37036-6_18.
23. K. Peters, U. Nestmann & U. Goltz (2013): On Distributability in Process Calculi (Appendix). Technical Report. TU Berlin. http://www.mtv.tu-berlin.de/fileadmin/a3435/pubs/distProcCal.pdf.
24. G.D. Plotkin (2004): A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60, pp. 17–140. [An earlier version of this paper was published as technical report at Aarhus University in 1981.].

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org