References

  1. N. Bogunovic & E. Pek (2003): Verification of mutual exclusion algorithms with SMV system.. EUROCON 2003. Computer as a Tool. The IEEE Region 8 2(3), pp. 21–25, doi:10.1109/EURCON.2003.1248127. Available at http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1248127.
  2. F. Buti, M. Callisto, F. Corradini, M.R. Di Berardini & W. Vogler (2009): Evaluating the Efficiency of Asynchronous Systems with FASE. In: pre-proceedings of the 1st Int. Workshop on Quantitative Formal Methods, Eindhoven (The Netherlands), pp. 101–106. Available at http://arxiv.org/abs/1105.1369.
  3. R. Cleaveland, T. Li & S. Sims (2000): The Concurrency Workbench of the New Century User's Manual. SUNY, Stony Brook, NY 11794-4400. Available at http://www.simsnet.org/papers/cwb-user.pdf.
  4. R. Cleaveland, J. Parrow & B. Steffen (1989): The Concurrency Workbench.. In: Joseph Sifakis: Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407. Springer, pp. 24–37.
  5. F. Corradini, M.R. Di Berardini & W. Vogler (2006): Checking a Mutex Algorithm in a Process Algebra with Fairness.. In: Christel Baier & Holger Hermanns: CONCUR, Lecture Notes in Computer Science 4137. Springer, pp. 142–157, doi:10.1007/11817949_10. Available at http://www.springerlink.com/content/jl71201p7585m448/.
  6. F. Corradini, M.R. Di Berardini & W. Vogler (2009): Time and Fairness in a Process Algebra with Non-blocking Reading.. In: Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma & Frank D. Valencia: SOFSEM, Lecture Notes in Computer Science 5404. Springer, pp. 193–204, doi:10.1007/978-3-540-95891-8_20. Available at http://www.springerlink.com/content/56vq063482528637/.
  7. F. Corradini & W. Vogler (2005): Measuring the performance of asynchronous systems with PAFAS. Theor. Comput. Sci. 335(2-3), pp. 187–213, doi:10.1016/j.tcs.2004.01.039. Available at http://portal.acm.org/citation.cfm?id=1085671.
  8. F. Corradini, W. Vogler & L. Jenner (2002): Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica 38(11), pp. 735–792, doi:10.1007/s00236-002-0094-3. Available at http://www.springerlink.com/content/2cuweb33bt0c1yqy/.
  9. G. Costa & C. Stirling (1984): A Fair Calculus of Communicating Systems.. Acta Inf. 21, pp. 417–441, doi:10.1007/BF00271640. Available at http://www.springerlink.com/content/w7lh13t23n670858/.
  10. G. Costa & C. Stirling (1987): Weak and Strong Fairness in CCS. Inf. Comput. 73(3), pp. 207–244, doi:10.1016/0890-5401(87)90013-7. Available at http://portal.acm.org/citation.cfm?id=29965.
  11. R. Milner (1989): Communication and concurrency. Prentice-Hall, Inc. Upper Saddle River, NJ, USA.
  12. R. De Nicola & M. Hennessy (1984): Testing equivalences for processes. TCS 34, pp. 83–133, doi:10.1016/0304-3975(84)90113-0. Available at http://www.springerlink.com/content/m5110675433345x7/.
  13. D. J. Walker (1989): Automated Analysis of Mutual Exclusion Algorithms using CCS.. Formal Asp. Comput. 1(3), pp. 273–292, doi:10.1007/BF01887209. Available at http://www.springerlink.com/content/m80614vt26566802/.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org