Welcome to the jungle: A subjective guide to mobile process calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4137 LNCS, Issue , 2006, Pages 52-63

  Nestmann, Uwe ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SCIENCE; SEMANTICS;

ACP; CCS; CSP; MOBILE PROCESS CALCULI;

MOBILE COMPUTING;

EID: 33749563572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_4     Document Type: Conference Paper

References (40)

1. [AF01] M. Abadi and C. Fournet. Mobile Values, New Names, and Secure Communication. In Proceedings of POPL '01, pages 104-115. ACM, Jan. 2001.
2. [AG99] M. Abadi and A. D. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation, 148(1):1-70, 1999.
3. [AT04] G. Agha and P. Thati. An Algebraic Theory of Actors and Its Application to a Simple Object-Based Language. In Essays in Memory of Ole-Johan Dahl, volume 2635 of LNCS, pages 26-57. Springer, 2004.
4. [Ber04] M. Berger. Basic Theory of Reduction Congruence for Two Timed Asynchronous π-Calculi. In P. Gardner and N. Yoshida, eds, Proceedings of CONCUR 2004, volume 3170 of LNCS, pages 115-130. Springer, Aug. 2004.
5. [Bou92] G. Boudol. Asynchrony and the π-calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
6. [CG00] L. Cardelli and A. D. Gordon. Mobile Ambients. Theoretical Computer Science, 240(1):177-213, 2000.
7. [Dal01] S. Dal-Zilio. Mobile Processes: a Commented Bibliograhy. In Proceedings of MOVEP'2K - 4th Summer school on Modelling and Verification of Parallel Processes), volume 2067 of LNCS, pages 206-222. Springer, 2001.
8. [DL04] V. Danos and C. Laneve. Formal Molecular Biology. Theoretical Computer Science, 325(1):69-110, 2004.
9. [EN86] U. Engberg and M. Nielsen. A Calculus of Communicating Systems with Label-passing. Technical Report DAIMI PB-208, Computer Science Department, University of Aarhus, Denmark, 1986.
10. [FG96] C. Fournet and G. Gonthier. The Reflexive Chemical Abstract Machine and the Join-Calculus. In Proceedings of POPL '96, pages 372-385. ACM, 1996.
11. [FG04] C. Fournet and G. Gonthier. A Hierarchy of Equivalences for Asynchronous Calculi. Journal of Logic and Algebraic Programming, 63(1):131-173, 2004.
12. [Gla93] R. Glabbeek. The Linear Time-Branching Time Spectrum II: The semantics of sequential systems with silent moves (Extended Abstract). In Proceedings of CONCUR '93, volume 715 of LNCS, pages 66-81. Springer, 1993.
13. [Gor02] A. D. Gordon. Notes on nominal calculi for security and mobility. In R. Focardi and R. Gorrieri, eds, Foundations of Security Analysis and Design, volume 2171 of LNCS, pages 262-330. Springer, 2002.
14. [HP00] O. M. Herescu and C. Palamidessi. Probabilistic Asynchronous π-Calculus. In J. Tiuryn, ed, Proceedings of FoSSaCS 2000, volume 1784 of LNCS, pages 146-160. Springer, 2000.
15. [HT92] K. Honda and M. Tokoro. On Asynchronous Communication Semantics. In M. Tokoro, O. Nierstrasz and P. Wegner, eds, Object-Based Concurrent Computing 1991, volume 612 of LNCS, pages 21-51. Springer, 1992.
16. [HY95] K. Honda and N. Yoshida. On Reduction-Based Process Semantics. Theoretical Computer Science, 152(2):437-486, 1995.
17. An extract appeared in Proceedings of FSTTCS '93, LNCS 761.
18. [Ing94] A. Ingólfsdóttir. Semantic Models for Communicating Processes with Value-Passing. PhD thesis, University of Sussex, 1994.
19. [Mil99] R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, May 1999.
20. [MPW92] R. Milner, J. Parrow and D. Walker. A Calculus of Mobile Processes, Part I/II. Information and Computation, 100:1-77, Sept. 1992.
21. [MS92] R. Milner and D. Sangiorgi. Barbed Bisiinulation. In W. Kuich, ed, Proceedings of ICALP '92, volume 623 of LNCS, pages 685-695. Springer, 1992.
22. [MS04] M. Merro and D. Sangiorgi. On Asynchrony in Name-Passing Calculi, Mathematical Structures in Computer Science, 14(5):715-767, 2004.
23. [Nes] U. Nestmann. Calculi for Mobile Processes, http://move.to/mobility.
24. [NV98] U. Nestmann and B. Victor. Calculi for Mobile Processes: Bibliography and Web Pages. EATCS Bulletin, 64:139-144, Feb. 1998.
25. [Pal03] C. Palamidessi. Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus. Mathematical Structures in Computer Science, 13(5):685-719, 2003.
26. [Par01] J. Parrow. An Introduction to the pi-Calculus. In Handbook of Process Algebra, pages 479-543. Elsevier Science, 2001.
27. [Pie97] B. C. Pierce. Foundational Calculi for Programming Languages. In Handbook of Computer Science and Engineering, pages 2190-2207. CRC Press. 1997.
28. [Pri95] C. Priami. Stochastic π-Calculus. The Computer Journal, 38(6):578-589, 1995. Proceedings of PAPM '95.
29. [PRSS01] C. Priami, A. Regev, E. Y. Shapiro and W. Silverman. Application of a Stochastic Name-Passing Calculus to Representation and Simulation of Molecular Processes. Information Processing Letters, 80(1):25-31, 2001.
30. [PS96] B. C. Pierce and D. Sangiorgi, Typing and Subtyping for Mobile Processes. Mathematical Structures in Computer Science, 6(5):409-454, 1996,
31. An extract appeared in Proceedings of LICS '93: 376-385.
32. [PW05] F. Puhlmann and M. Weske. Using the π-Calculus for Formalizing Workflow Patterns. In Proceedings of BPM 2005, volume 3649 of LNCS, pages 153-168. Springer, 2005.
33. [RH98] J. Riely and M. Hennessy. A Typed Language for Distributed Mobile Processes. In Proceedings of POPL '98. ACM, 1998.
34. [San01] D. Sangiorgi. Asynchronous process calculi: the first-order and higher-order paradigms (Tutorial). Theoretical Computer Science, 253(2):311-350, 2001.
35. [Sew00] P. Sewell. Applied Pi -A Brief Tutorial. Technical Report 498, Computer Laboratory, University of Cambridge, 2000.
36. [SW01] D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
37. [Uny01] A. Unyapoth. Nomadic Pi Calculi: Expressing and Verifying Infrastructure for Mobile Computation. PhD thesis, University of Cambridge, June 2001.
38. [Vas94] V. T. Vasconcelos. Typed Concurrent Objects. In Proceedings of ECOOP '94, volume 821 of LNCS, pages 100-117. Springer, 1994.
39. [WS00] P. Wojciechowski and P. Sewell. Nomadic Pict: Language and Infrastructure Design for Mobile Agents. IEEE Concurrency, 8(2):42-52, 2000.
40. [Yos02] N. Yoshida. Minimality and separation results on asynchronous mobile processes -Representability theorems by concurrent combinators. Theoretical Computer Science, 274(1-2):231-276, 2002.