Anhang – Weiterführende Literatur

1. Abdallah AE, Jones CB, Sanders JW (Hrsg) (2005) Communicating sequential processes, the first 25 years. Springer, Berlin/Heidelberg 2. Andrews GR (1989) A method for solving synchronization problems. Sci Comput Prog 13:1–21. https://doi.org/10.1016/0167-6423(89)90013-0 3. Andrews GR (1991) Paradigms for process interaction in distributed programs. ACM Comput Surv 23:49–90. https://doi.org/10.1145/103162.103164 4. Andrews GR, Schneider FB (1983) Concepts and notations for concurrent programming. ACM Comput Surv 15:3–43. https://doi.org/10.1145/356901.356903 5. Annot JK, Janssens MD, Van de Goor AJ (1986) Comments on Morris’s starvation-free solution to the mutual exclusion problem. Inf Proc Lett 23:91–97 6. Apt KR, de Boer FS, Olderog E-R (2009) Verification of sequential and concurrent programs. Springer, Dodrecht. https://doi.org/10.1007/978-1-84882-745-5 7. Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations, and advanced topics. Wiley, Hoboken 8. Axford T (1989) Concurrent programming. Wiley, New York 9. Bacon J (2003) Concurrent systems. Operating systems, distributed and database systems, 3. Aufl. Addison-Wesley, Reading 10. Bernstein AJ (1980) Output guards and nondeterminism in ”communicating sequential processes”. ACM Trans Program Lang Syst 2:234–238. https://doi.org/10.1145/357094.357101 11. Birrell AD, Nelson BJ (1984) Implementing remote procedure calls. ACM Trans Comput Syst 2:39–59. https://doi.org/10.1145/2080.357392 12. Block K, Woo T-K (1990) A more efficient generalization of Peterson’s mutual exclusion algorithm. Inf Proc Lett 35:219–222. https://doi.org/10.1016/0020-0190(90)90048-3 13. Breshears C (2009) The art of concurrency: A thread monkey’s guide to writing parallel applications. O’Reilly, Beijing 14. Brinch Hansen P (1999) Java’s insecure parallelism. ACM SIGPLAN Not 34:38–45. https://doi. org/10.1145/312009.312034 15. Brinch Hansen P (Hrsg) (2002) The origin of concurrent programming. Springer, New York