1. Jos C. M. Baeten, Jan A. Bergstra & Jan Willem Klop (1986): Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra. Fundamenta Informaticae IX(2), pp. 127–168.
  2. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2009): Psi-calculi: Mobile processes, nominal data, and logic. In: Proceedings of LICS 2009. IEEE Computer Society, pp. 39–48, doi:10.1109/lics.2009.20.
  3. 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.
  4. Wayne D. Blizard (1990): Negative membership.. Notre Dame Journal of Formal Logic 31(3), pp. 346–368, doi:10.1305/ndjfl/1093635499.
  5. Roland N. Bol & Jan Friso Groote (1996): The Meaning of Negative Premises in Transition System Specifications. J. ACM 43(5), pp. 863–914, doi:10.1145/234752.234756.
  6. Johannes Borgström, Ramūnas Gutkovas, Joachim Parrow, Björn Victor & Johannes Åman Pohjola (2014): A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract). In: Trustworthy Global Computing. Springer Science + Business Media, pp. 103–118, doi:10.1007/978-3-319-05119-2_7.
  7. Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola & Joachim Parrow (2011): Broadcast Psi-calculi with an Application to Wireless Protocols. In: Software Engineering and Formal Methods: SEFM 2011, Lecture Notes in Computer Science 7041. Springer-Verlag, pp. 74–89, doi:10.1007/s10270-013-0375-z.
  8. Juanito Camilleri & Glynn Winskel (1991): CCS with priority choice. In: Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science. IEEE Comput. Sco. Press, pp. 246–255, doi:10.1109/lics.1991.151649.
  9. Rance Cleaveland & Matthew Hennessy (1988): Priorities in Process Algebras. In: LICS. IEEE Computer Society, pp. 193–202, doi:10.1109/lics.1988.5118.
  10. Rance Cleaveland, Gerald Lüttgen & V. Natarajan (2001): Priority in Process Algebra. In: Jan A. Bergstra, Alban Ponse & Scott A. Smolka: Handbook of Process Algebra. Elsevier Science Publishers, pp. 711–765, doi:10.1016/B978-044482830-9/50030-8.
  11. Cristian Ene & Traian Muntean (1999): Expressiveness of point-to-point versus broadcast communications. In: Proceedings of FCT'99, Lecture Notes in Computer Science 1684. Springer-Verlag, pp. 258–268, doi:10.1007/3-540-48321-7_21.
  12. Murdoch J. Gabbay & Andrew M. Pitts (2002): A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing 13, pp. 341–363, doi:10.1007/s001650200016.
  13. Daniele Gorla (2008): Towards a Unified Approach to Encodability and Separation Results for Process Calculi. In: CONCUR, Lecture Notes in Computer Science 5201. Springer, pp. 492–507, doi:10.1007/978-3-540-85361-9_38.
  14. Daniele Gorla & Uwe Nestmann (2014): Full Abstraction for Expressiveness: History, Myths and Facts. Mathematical Structures in Computer Science. To appear.
  15. Alan Jeffrey (1991): Translating Timed Process Algebra into Prioritized Process Algebra. In: FTRTFT, Lecture Notes in Computer Science 571. Springer, pp. 493–506, doi:10.1007/3-540-55092-5_27.
  16. Claus Torp Jensen (1994): Interpreting Broadcast Communication in CCS with Priority Choice. In: Proceedings of the 6th Nordic Workshop on Programming Theory 203–5, pp. 49–70.
  17. Mathias John, Cédric Lhoussaine, Joachim Niehren & Adelinde Uhrmacher (2010): The Attributed Pi-Calculus with Priorities. Transactions on Computational Systems Biology XII 5945/2010, pp. 13–76, doi:10.1007/978-3-642-11712-1_2.
  18. Tobias Nipkow, Lawrence C. Paulson & Markus Wenzel (2002): Isabelle/HOL: a Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science 2283. Springer-Verlag, doi:10.1007/3-540-45949-9_7.
  19. Joachim Parrow (2008): Expressiveness of Process Algebras. Electronic Notes in Theoretical Computer Science 209, pp. 173–186, doi:10.1016/j.entcs.2008.04.011.
  20. Joachim Parrow (2014): General Conditions for Full Abstraction. Mathematical Structures in Computer Science. To appear.
  21. Andrew M. Pitts (2003): Nominal Logic, A First Order Theory of Names and Binding. Information and Computation 186, pp. 165–193, doi:10.1016/s0890-5401(03)00138-x.
  22. Cristian Versari (2007): A Core Calculus for a Comparative Analysis of Bio-inspired Calculi. In: Rocco De Nicola: ESOP, Lecture Notes in Computer Science 4421. Springer, pp. 411–425, doi:10.1007/978-3-540-71316-6_28.
  23. Cristian Versari, Nadia Busi & Roberto Gorrieri (2007): On the Expressive Power of Global and Local Priority in Process Calculi. In: CONCUR, Lecture Notes in Computer Science 4703. Springer, pp. 241–255, doi:10.1007/978-3-540-74407-8_17.

Comments and questions to:
For website issues: