1. J. C. M. Baeten, T. Basten & M. A. Reniers (2009): Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, doi:10.1017/CBO9781139195003.
  2. J.C.M. Baeten (2005): A brief history of process algebra. Theoretical Computer Science 335(2-3), pp. 131–146, doi:10.1016/j.tcs.2004.07.036.
  3. Mark Bouwman, Bas Luttik & Tim A. C. Willemse (2020): Off-the-shelf automated analysis of liveness properties for just paths. Acta Informatica 57(3-5), pp. 551–590, doi:10.1007/s00236-020-00371-w.
  4. Victor Dyseryn, Rob J. van Glabbeek & Peter Höfner (2017): Analysing Mutual Exclusion using Process Algebra with Signals. In: Kirstin Peters & Simone Tini: Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics and 14th Workshop on Structural Operational Semantics, EXPRESS/SOS 2017, Berlin, Germany, 4th September 2017., EPTCS 255, pp. 18–34, doi:10.4204/EPTCS.255.2.
  5. Rob J. van Glabbeek & Peter Höfner (2015): CCS: It's not fair! - Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions. Acta Inf. 52(2-3), pp. 175–205, doi:10.1007/s00236-015-0221-6.
  6. Jan Friso Groote & Mohammad Reza Mousavi (2014): Modeling and analysis of communicating systems. MIT press, doi:10.7551/mitpress/9946.001.0001.
  7. Matthew Hennessy & Robin Milner (1985): Algebraic Laws for Nondeterminism and Concurrency. J. ACM 32(1), pp. 137–161, doi:10.1145/2455.2460.
  8. Robin Milner (1989): Communication and concurrency. PHI Series in computer science. Prentice Hall.
  9. Mohammad Reza Mousavi, Michel A. Reniers & Jan Friso Groote (2005): Notions of bisimulation and congruence formats for SOS with data. Inf. Comput. 200(1), pp. 107–147, doi:10.1016/j.ic.2005.03.002.
  10. Rocco De Nicola & Rosario Pugliese (1996): A Process Algebra Based on LINDA. In: COORDINATION, Lecture Notes in Computer Science 1061. Springer, pp. 160–178, doi:10.1007/3-540-61052-9_45.
  11. A. W. Roscoe (2010): Understanding Concurrent Systems. Texts in Computer Science. Springer, doi:10.1007/978-1-84882-258-0.
  12. Vijay A. Saraswat, Martin C. Rinard & Prakash Panangaden (1991): Semantic Foundations of Concurrent Constraint Programming. In: POPL. ACM Press, pp. 333–352, doi:10.1145/99583.99627.
  13. Muck van Weerdenburg (2008): Process Algebra with Local Communication. Electron. Notes Theor. Comput. Sci. 215, pp. 191–208, doi:10.1016/j.entcs.2008.06.028.

Comments and questions to:
For website issues: