References

  1. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2011): Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science 7(1), doi:10.2168/LMCS-7(1:11)2011.
  2. Laura Bocchi & Lucian Wischik (2004): A Process Calculus of Atomic Commit. Electronic Notes in Theoretical Computer Science 105(0), pp. 119 – 132, doi:10.1016/j.entcs.2004.05.003. Proceedings of the First International Workshop on Web Services and Formal Methods (WSFM 2004).
  3. M. Boreale, C. Fournet & C. Laneve (1998): Bisimulations in the Join-Calculus. In: Programming Concepts and Methods PROCOMET ’98, IFIP — The International Federation for Information Processing. Springer US, pp. 68–86, doi:10.1007/978-0-387-35358-6_9.
  4. Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor & Johannes Åman Pohjola (2013): A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract). In: Trustworthy Global Computing, pp. 103–118, doi:10.1007/978-3-319-05119-2_7.
  5. Nadia Busi, Roberto Gorrieri & Gianluigi Zavattaro (2000): On the Expressiveness of Linda Coordination Primitives.. Information and Computation 156(1-2), pp. 90–121, doi:10.1006/inco.1999.2823.
  6. Marco Carbone & Sergio Maffeis (2003): On the Expressive Power of Polyadic Synchronisation in π-calculus. Nordic Journal of Computing 10(2), pp. 70–98, doi:10.1.1.15.577.
  7. Luca Cardelli & Andrew D. Gordon (1998): Mobile Ambients. In: Foundations of Software Science and Computation Structures: First International Conference, FoSSaCS '98, pp. 140–155, doi:10.1007/BFb0053547.
  8. Giuseppe Castagna, Rocco De Nicola & Daniele Varacca (2008): Semantic Subtyping for the Pi-calculus. Theoretical Computer Science 398(1-3), pp. 217–242, doi:10.1016/j.tcs.2008.01.049.
  9. Rocco De Nicola, Daniele Gorla & Rosario Pugliese (2006): On the Expressive Power of KLAIM-based Calculi. Theoretical Computer Science 356(3), pp. 387–421, doi:10.1016/j.tcs.2006.02.007.
  10. Cedric Fournet & Georges Gonthier: The reflexive CHAM and the join-calculus. In: Proceedings of the 23rd ACM Symposium on Principles of Programming Languages. ACM Press, pp. 372–385, doi:10.1.1.495.7510.
  11. David Gelernter (1985): Generative communication in Linda. ACM Transactions on Programming Languages and Systems 7(1), pp. 80–112, doi:10.1145/2363.2433.
  12. Thomas Given-Wilson (2012): Concurrent Pattern Unification. PhD thesis, University of Technology, Sydney, Australia.
  13. Thomas Given-Wilson (2014): An Intensional Concurrent Faithful Encoding of Turing Machines. In: Ivan Lanese, Alberto Lluch-Lafuente, Ana Sokolova & Hugo Torres Vieira: Proceedings 7th Interaction and Concurrency Experience, ICE 2014, Berlin, Germany, 6th June 2014., EPTCS 166, pp. 21–37, doi:10.4204/EPTCS.166.4.
  14. Thomas Given-Wilson (2014): On the Expressiveness of Intensional Communication. In: Combined 21th International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, Rome, Italie, doi:10.4204/EPTCS.160.4.
  15. Thomas Given-Wilson & Daniele Gorla (2013): Pattern Matching and Bisimulation. In: Coordination Models and Languages, Lecture Notes in Computer Science 7890. Springer Berlin Heidelberg, pp. 60–74, doi:10.1007/978-3-642-38493-6_5.
  16. Thomas Given-Wilson, Daniele Gorla & Barry Jay (2010): Concurrent Pattern Calculus. In: Theoretical Computer Science, IFIP Advances in Information and Communication Technology 323. Springer Berlin Heidelberg, pp. 244–258, doi:10.1007/978-3-642-15240-5_18.
  17. Thomas Given-Wilson, Daniele Gorla & Barry Jay (2014): A Concurrent Pattern Calculus. Logical Methods in Computer Science 10(3), doi:10.2168/LMCS-10(3:10)2014.
  18. Rob 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.
  19. D. Gorla (2008): Comparing Communication Primitives via their Relative Expressive Power. Information and Computation 206(8), pp. 931–952, doi:10.1016/j.ic.2008.05.001.
  20. 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.
  21. 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.
  22. Christian Haack & Alan Jeffrey (2006): Pattern-matching Spi-calculus. Information and Computation 204(8), pp. 1195–1263, doi:10.1016/j.ic.2006.04.004.
  23. Kohei Honda & Mario Tokoro (1991): An object calculus for asynchronous communication. In: ECOOP'91 European Conference on Object-Oriented Programming. Springer, pp. 133–147, doi:10.1.1.53.4500.
  24. Kohei Honda & Nobuko Yoshida (1995): On reduction-based process semantics. Theoretical Computer Science 152, pp. 437–486, doi:10.1016/0304-3975(95)00074-7.
  25. Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi & Alan Schmitt (2010): On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi. In: Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), LNCS 6199. Springer, pp. 442–453, doi:10.1007/978-3-642-14162-1_37.
  26. Ivan Lanese, Cátia Vaz & Carla Ferreira (2010): On the Expressive Power of Primitives for Compensation Handling. In: Proceedings of the 19th European Conference on Programming Languages and Systems, ESOP'10. Springer-Verlag, Berlin, Heidelberg, pp. 366–386, doi:10.1007/978-3-642-11957-6_20.
  27. Robin Milner (1993): The Polyadic π-Calculus: A Tutorial. In: Logic and Algebra of Specification, Series F 94. NATO ASI. Springer, doi:10.1007/978-3-642-58041-3_6.
  28. Robin Milner, Joachim Parrow & David Walker (1992): A Calculus of Mobile Processes, I. Information and Computation 100(1), pp. 1–40, doi:10.1016/0890-5401(92)90008-4.
  29. Robin Milner, Joachim Parrow & David Walker (1992): A Calculus of Mobile Processes, II. Information and Computation 100(1), pp. 41–77, doi:10.1016/0890-5401(92)90009-5.
  30. Rocco De Nicola, Gian Luigi Ferrari & Rosario Pugliese (1998): KLAIM: A Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering 24(5), pp. 315–330, doi:10.1109/32.685256.
  31. Catuscia Palamidessi (2003): Comparing the Expressive Power of the Synchronous and Asynchronous pi-calculi. Mathematical. Structures in Comp. Sci. 13(5), pp. 685–719, doi:10.1017/S0960129503004043.
  32. Vijay A. Saraswat, Martin Rinard & Prakash Panangaden (1991): The Semantic Foundations of Concurrent Constraint Programming. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '91. ACM, New York, NY, USA, pp. 333–352, doi:10.1145/99583.99627.
  33. Alan Schmitt & Jean-Bernard Stefani (2003): The m-calculus: a higher-order distributed process calculus. In: Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New Orleans, Louisisana, USA, January 15-17, 2003, pp. 50–61, doi:10.1145/640128.604136.
  34. Christian Urban, Stefan Berghofer & Michael Norrish (2007): Barendregt’s Variable Convention in Rule Inductions. In: Automated Deduction – CADE-21, Lecture Notes in Computer Science 4603. Springer Berlin Heidelberg, pp. 35–50, doi:10.1007/978-3-540-73595-3_4.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org