References

  1. L. Aceto (1994): A Static View of Localities. Formal Aspects of Computing 6(2), pp. 201–222, doi:10.1007/BF01221099.
  2. L. Aceto, A. Ingólfsdóttir, K. G. Larsen & J. Srba (2007): Modelling Mutual Exclusion Algorithms. In: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, pp. 142–158, doi:10.1017/CBO9780511814105.008.
  3. J. C. M. Baeten & C. Verhoef (1993): A Congruence Theorem for Structured Operational Semantics with Predicates. In: E. Best: Proc. CONCUR '93, LNCS 715. Springer, pp. 477–492, doi:10.1007/3-540-57208-2_33.
  4. J. A. Bergstra (1988): ACP with Signals. In: J. Grabowski, P. Lescanne & W. Wechler: Proc. Int. Workshop on Algebraic and Logic Programming, LNCS 343. Springer, pp. 11–20, doi:10.1007/3-540-50667-5_53.
  5. A. Bouali (1992): Weak and Branching Bisimulation in Fctool. Research Report RR-1575. Inria-Sophia Antipolis. Available at https://hal.inria.fr/inria-00074985/document.
  6. G. Boudol, I. Castellani, M. Hennessy & A. Kiehn (1993): Observing Localities. Theoretical Computer Science 114(1), pp. 31–61, doi:10.1016/0304-3975(93)90152-J.
  7. G. Boudol, I. Castellani, M. Hennessy & A. Kiehn (1994): A Theory of Processes with Localities. Formal Aspects of Computing 6(2), pp. 165–200, doi:10.1007/BF01221098.
  8. F. Buti, M. Callisto De Donato, F. Corradini, M. R. Di Berardini & W. Vogler (2011): Automated Analysis of MUTEX Algorithms with FASE. In: G. D'Agostino & S. La Torre: Proc. GandALF '11, EPTCS 54. Open Publishing Association, pp. 45–59, doi:10.4204/EPTCS.54.4.
  9. F. Corradini, M. R. Di Berardini & W. Vogler (2009): Liveness of a Mutex Algorithm in a Fair Process Algebra. Acta Informatica 46(3), pp. 209–235, doi:10.1007/s00236-009-0092-9.
  10. F. Corradini, M. R. Di Berardini & W. Vogler (2009): Time and Fairness in a Process Algebra with Non-blocking Reading. In: M. Nielsen, A. Kucera, P. Bro Miltersen, C. Palamidessi, P. Tuma & F. D. Valencia: Theory and Practice of Computer Science (SOFSEM'09), LNCS 5404. Springer, pp. 193–204, doi:10.1007/978-3-540-95891-8_20.
  11. F. Corradini, M. R. Di Berardini & W. Vogler (2011): Read Operators and their Expressiveness in Process Algebras. In: B. Luttik & F. Valencia: Proc. EXPRESS '11, EPTCS 64. Open Publishing Association, pp. 31–43, doi:10.4204/EPTCS.64.3.
  12. F. Corradini, W. Vogler & L. Jenner (2002): Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica 38(11/12), pp. 735–792, doi:10.1007/s00236-002-0094-3.
  13. E. W. Dijkstra (1962 or 1963): Over de Sequentialiteit van Procesbeschrijvingen. Available at http://www.cs.utexas.edu/users/EWD/ewd00xx/EWD35.PDF. Circulated privately.
  14. E. W. Dijkstra (1965): Solution of a problem in concurrent programming control. Communications of the ACM 8(9), pp. 569, doi:10.1145/365559.365617.
  15. E. W. Dijkstra (1968): Cooperating Sequential Processes. In: F. Genuys: Programming Languages: NATO Advanced Study Institute. Academic Press, pp. 43–112.
  16. J. Esparza & G. Bruns (1996): Trapping Mutual Exclusion in the Box Calculus. Theoretical Computer Science 153(1-2), pp. 95–128, doi:10.1016/0304-3975(95)00119-0.
  17. A. Fehnker, R. J. van Glabbeek, P Höfner, A. K. McIver, M. Portmann & W. L. Tan (2013): A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV. Technical Report 5513. NICTA. Available at http://arxiv.org/abs/1312.7645.
  18. N. Francez (1986): Fairness. Springer, doi:10.1007/978-1-4612-4886-6.
  19. R. J. van Glabbeek (2011): Bisimulation. In: D. Padua: Encyclopedia of Parallel Computing. Springer, pp. 136–139, doi:10.1007/978-0-387-09766-4_149.
  20. R. J. van Glabbeek & P. 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 Informatica 52(2–3), pp. 175–205, doi:10.1007/s00236-015-0221-6.
  21. R. J. van Glabbeek & P. Höfner (2015): Progress, Fairness and Justness in Process Algebra. CoRR abs/1501.03268. Available at http://arxiv.org/abs/1501.03268.
  22. E. Kindler & R. Walter (1997): Mutex Needs Fairness. Information Processing Letters 62(1), pp. 31–39, doi:10.1016/S0020-0190(97)00033-1.
  23. L. Kleinrock (1964): Analysis of A Time-Shared Processor. Naval Research Logistics Quarterly 11(1), pp. 59–73, doi:10.1002/nav.3800110105.
  24. D. E. Knuth (1966): Additional comments on a problem in concurrent programming control. Communications of the ACM 9(5), pp. 321–322, doi:10.1145/355592.365595.
  25. L. Lamport (1974): A New Solution of Dijkstra's Concurrent Programming Problem. Communications of the ACM 17(8), pp. 453–455, doi:10.1145/361082.361093.
  26. R. Milner (1989): Communication and Concurrency. Prentice Hall.
  27. M. Mukund & M. Nielsen (1992): CCS, Locations and Asynchronous Transition Systems. In: R. K. Shyamasundar: Proc. FSTTCS '92, LNCS 652. Springer, pp. 328–341, doi:10.1007/3-540-56287-7_116.
  28. J. Nagle (1985): On Packet Switches with Infinite Storage. RFC 970, Network Working Group. Available at http://tools.ietf.org/rfc/rfc970.txt.
  29. J. Nagle (1987): On Packet Switches with Infinite Storage. IEEE Trans. Communications 35(4), pp. 435–438, doi:10.1109/TCOM.1987.1096782.
  30. S. S. Owicki & L. Lamport (1982): Proving Liveness Properties of Concurrent Programs. ACM TOPLAS 4(3), pp. 455–495, doi:10.1145/357172.357178.
  31. G. L. Peterson (1981): Myths About the Mutual Exclusion Problem. Information Processing Letters 12(3), pp. 115–116, doi:10.1016/0020-0190(81)90106-X.
  32. A. Valmari & M. Setälä (1996): Visual Verification of Safety and Liveness. In: M.-C. Gaudel & J. Woodcock: Industrial Benefit and Advances in Formal Methods (FME'96), LNCS 1051. Springer, pp. 228–247, doi:10.1007/3-540-60973-3_90.
  33. W. Vogler (2002): Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theoretical Computer Science 275(1-2), pp. 589–631, doi:10.1016/S0304-3975(01)00300-0.
  34. D. J. Walker (1989): Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing 1(1), pp. 273–292, doi:10.1007/BF01887209.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org