{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:16:24Z","timestamp":1784873784731,"version":"3.55.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T00:00:00Z","timestamp":1426723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00236-015-0221-6","type":"journal-article","created":{"date-parts":[[2015,3,18]],"date-time":"2015-03-18T18:07:07Z","timestamp":1426702027000},"page":"175-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["CCS: It\u2019s not fair!"],"prefix":"10.1007","volume":"52","author":[{"given":"Rob J.","family":"van Glabbeek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"H\u00f6fner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,19]]},"reference":[{"key":"221_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.G., Srba, J.: Modelling mutual exclusion algorithms. In: Reactive Systems: Modelling, Specification and Verification, pp. 142\u2013158. Cambridge University Press (2007). doi: 10.1017\/CBO9780511814105.008","DOI":"10.1017\/CBO9780511814105.008"},{"issue":"4","key":"221_CR2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"KR Apt","year":"1988","unstructured":"Apt, K.R., Francez, N., Katz, S.: Appraising fairness in languages for distributed programming. Distrib. Comput. 2(4), 226\u2013241 (1988). doi: 10.1007\/BF01872848","journal-title":"Distrib. Comput."},{"issue":"2","key":"221_CR3","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BF01214556","volume":"8","author":"JCM Baeten","year":"1996","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Discrete time process algebra. Form. Asp. Comput. 8(2), 188\u2013208 (1996). doi: 10.1007\/BF01214556","journal-title":"Form. Asp. Comput."},{"issue":"1\/2","key":"221_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"JCM Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen\u2019s fair abstraction rule. Theor. Comput. Sci. 51(1\/2), 129\u2013176 (1987). doi: 10.1016\/0304-3975(87)90052-1","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"221_CR5","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","volume":"30","author":"JCM Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Ready-trace semantics for concrete process algebra with the priority operator. Comput. J. 30(6), 498\u2013506 (1987). doi: 10.1093\/comjnl\/30.6.498","journal-title":"Comput. J."},{"key":"221_CR6","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Luttik, B., van Tilburg, P.: Reactive turing machines. In: Owe, O., Steffen, M., Telle, J.A. (eds.) Fundamentals of Computation Theory, pp. 348\u2013359 (2011). doi: 10.1007\/978-3-642-22953-4_30","DOI":"10.1007\/978-3-642-22953-4_30"},{"key":"221_CR7","first-page":"89","volume-title":"Mathematics and Computer Science, CWI Monograph 1","author":"JA Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes. In: de Bakker, J.W., Hazewinkel, M., Lenstra, J.K. (eds.) Mathematics and Computer Science, CWI Monograph 1, pp. 89\u2013138. North-Holland, Amsterdam (1986)"},{"key":"221_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/3-540-16444-8_1","volume-title":"Mathematical Methods of Specification and Synthesis of Software Systems \u201985, LNCS","author":"JA Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Verification of an alternating bit protocol by means of process algebra. In: Bibel, W., Jantke, K.P. (eds.) Mathematical Methods of Specification and Synthesis of Software Systems \u201985, LNCS, vol. 215, pp. 9\u201323. Springer, Berlin (1986). doi: 10.1007\/3-540-16444-8_1"},{"key":"221_CR9","first-page":"25","volume":"14","author":"T Bolognesi","year":"1987","unstructured":"Bolognesi, T., Brinksma, E.: Introduction to the ISO specification language LOTOS. Comput. Netw. 14, 25\u201359 (1987). doi: 10.1016\/0169-7552(87)90085-7","journal-title":"Comput. Netw."},{"key":"221_CR10","unstructured":"Bouali, A.: Weak and branching bisimulation in Fctool. Research Report RR-1575, Inria-Sophia Antipolis (1992). https:\/\/hal.inria.fr\/inria-00074985\/document"},{"issue":"3","key":"221_CR11","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984). doi: 10.1145\/828.833","journal-title":"J. ACM"},{"key":"221_CR12","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/B978-044482830-9\/50030-8","volume-title":"Handbook of Process Algebra, chapter 12","author":"R Cleaveland","year":"2001","unstructured":"Cleaveland, R., L\u00fcttgen, G., Natarajan, V.: Priority in process algebra. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, chapter 12, pp. 711\u2013765. Elsevier, Amsterdam (2001). doi: 10.1016\/B978-044482830-9\/50030-8"},{"issue":"2","key":"221_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00236-006-0011-2","volume":"43","author":"F Corradini","year":"2006","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W.: Fairness of actions in system computations. Acta Inform. 43(2), 73\u2013130 (2006). doi: 10.1007\/s00236-006-0011-2","journal-title":"Acta Inform."},{"issue":"3","key":"221_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s00236-009-0092-9","volume":"46","author":"F Corradini","year":"2009","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W.: Liveness of a mutex algorithm in a fair process algebra. Acta Inform. 46(3), 209\u2013235 (2009). doi: 10.1007\/s00236-009-0092-9","journal-title":"Acta Inform."},{"key":"221_CR15","first-page":"193","volume-title":"Theory and Practice of Computer Science (SOFSEM\u201909)","author":"F Corradini","year":"2009","unstructured":"Corradini, F., Di Berardini, M.R., Vogler, W.: Time and fairness in a process algebra with non-blocking reading, LNCS. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) Theory and Practice of Computer Science (SOFSEM\u201909), vol. 5404, pp. 193\u2013204. Springer, Berlin (2009). doi: 10.1007\/978-3-540-95891-8_20"},{"issue":"11\/12","key":"221_CR16","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s00236-002-0094-3","volume":"38","author":"F Corradini","year":"2002","unstructured":"Corradini, F., Vogler, W., Jenner, L.: Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Inform. 38(11\/12), 735\u2013792 (2002). doi: 10.1007\/s00236-002-0094-3","journal-title":"Acta Inform."},{"key":"221_CR17","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BF00271640","volume":"21","author":"G Costa","year":"1984","unstructured":"Costa, G., Stirling, C.: A fair calculus of communicating systems. Acta Inform. 21, 417\u2013441 (1984). doi: 10.1007\/BF00271640","journal-title":"Acta Inform."},{"issue":"3","key":"221_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0890-5401(87)90013-7","volume":"73","author":"G Costa","year":"1987","unstructured":"Costa, G., Stirling, C.: Weak and strong fairness in CCS. Inf. Comput. 73(3), 207\u2013244 (1987). doi: 10.1016\/0890-5401(87)90013-7","journal-title":"Inf. Comput."},{"key":"221_CR19","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-18419-8_13","volume-title":"Mathematical Models for the Semantics of Parallelism, LNCS","author":"P Degano","year":"1987","unstructured":"Degano, P., De Nicola, R., Montanari, U.: CCS is an (augmented) contact free C\/E system. In: Zilli, M.V. (ed.) Mathematical Models for the Semantics of Parallelism, LNCS, vol. 280, pp. 144\u2013165. Springer, Berlin (1987). doi: 10.1007\/3-540-18419-8_13"},{"key":"221_CR20","unstructured":"Dijkstra, E.W.: Over de sequentialiteit van procesbeschrijvingen (1962 or 1963). http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd00xx\/EWD35.PDF . Circulated privately"},{"key":"221_CR21","first-page":"43","volume-title":"Programming Languages: NATO Advanced Study Institute","author":"EW Dijkstra","year":"1968","unstructured":"Dijkstra, E.W.: Cooperating sequential processes. In: Genuys, F. (ed.) Programming Languages: NATO Advanced Study Institute, pp. 43\u2013112. Academic Press, London (1968)"},{"issue":"1\u20132","key":"221_CR22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(95)00119-0","volume":"153","author":"J Esparza","year":"1996","unstructured":"Esparza, J., Bruns, G.: Trapping mutual exclusion in the box calculus. Theor. Comput. Sci. 153(1\u20132), 95\u2013128 (1996). doi: 10.1016\/0304-3975(95)00119-0","journal-title":"Theor. Comput. Sci."},{"key":"221_CR23","unstructured":"Fehnker, A., van Glabbeek, R.J., H\u00f6fner, P., McIver, A.K., Portmann, M., Tan, W.L.: A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV. Technical Report 5513, NICTA (2013). http:\/\/arxiv.org\/abs\/1312.7645"},{"key":"221_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N Francez","year":"1986","unstructured":"Francez, N.: Fairness. Springer, Berlin (1986). doi: 10.1007\/978-1-4612-4886-6"},{"key":"221_CR25","first-page":"163","volume-title":"Principles of Programming Languages (POPL \u201980)","author":"DM Gabbay","year":"1980","unstructured":"Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Abrahams, P.W., Lipton, R.J., Bourne, S.R. (eds.) Principles of Programming Languages (POPL \u201980), pp. 163\u2013173. ACM, New York (1980). doi: 10.1145\/567446.567462"},{"issue":"2","key":"221_CR26","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ic.2004.07.002","volume":"194","author":"DQ Goldin","year":"2004","unstructured":"Goldin, D.Q., Smolka, S.A., Attie, P.C., Sonderegger, E.L.: Turing machines, transition systems, and interaction. Inf. Comput. 194(2), 101\u2013128 (2004). doi: 10.1016\/j.ic.2004.07.002","journal-title":"Inf. Comput."},{"issue":"9","key":"221_CR27","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031\u20131053 (2010). doi: 10.1016\/j.ic.2010.05.002","journal-title":"Inf. Comput."},{"key":"221_CR28","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-1-4471-2120-6_2","volume-title":"Algebra of Communicating Processes \u201994, Workshops in Computing","author":"JF Groote","year":"1995","unstructured":"Groote, J.F., Ponse, A.: The syntax and semantics of $$\\mu $$ \u03bc CRL. In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.) Algebra of Communicating Processes \u201994, Workshops in Computing, pp. 26\u201362. Springer, Berlin (1995). doi: 10.1007\/978-1-4471-2120-6_2"},{"key":"221_CR29","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabitilies. In: Real-Time Systems Symposium (RTSS \u201990), pp. 278\u2013287. IEEE Computer Society (1990). doi: 10.1109\/REAL.1990.128759","DOI":"10.1109\/REAL.1990.128759"},{"issue":"2","key":"221_CR30","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, R.: A process algebra for timed systems. Inf. Comput. 117(2), 221\u2013239 (1995). doi: 10.1006\/inco.1995.1041","journal-title":"Inf. Comput."},{"key":"221_CR31","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"issue":"1","key":"221_CR32","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0020-0190(97)00033-1","volume":"62","author":"E Kindler","year":"1997","unstructured":"Kindler, E., Walter, R.: Mutex needs fairness. Inf. Process. Lett. 62(1), 31\u201339 (1997). doi: 10.1016\/S0020-0190(97)00033-1","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"221_CR33","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800110105","volume":"11","author":"L Kleinrock","year":"1964","unstructured":"Kleinrock, L.: Analysis of a time-shared processor. Naval Res. Logist. Q. 11(1), 59\u201373 (1964). doi: 10.1002\/nav.3800110105","journal-title":"Naval Res. Logist. Q."},{"issue":"3","key":"221_CR34","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L Lamport","year":"1994","unstructured":"Lamport, L.: The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16(3), 872\u2013923 (1994). doi: 10.1145\/177492.177726","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"221_CR35","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00266047","volume":"12","author":"PE Lauer","year":"1979","unstructured":"Lauer, P.E., Torrigiani, P.R., Shields, M.W.: COSY: a system specification language based on paths and processes. Acta Inform. 12, 109\u2013158 (1979). doi: 10.1007\/BF00266047","journal-title":"Acta Inform."},{"key":"221_CR36","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-45627-9_8","volume-title":"Theory and Practice of Informatics (SOFSEM \u201901), LNCS","author":"J Leeuwen van","year":"2001","unstructured":"van Leeuwen, J., Wiedermann, J.: Beyond the turing limit: evolving interactive systems. In: Pacholski, L., Ruzicka, P. (eds.) Theory and Practice of Informatics (SOFSEM \u201901), LNCS, vol. 2234, pp. 90\u2013109. Springer, Berlin (2001). doi: 10.1007\/3-540-45627-9_8"},{"key":"221_CR37","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-10843-2_22","volume-title":"Automata, Languages and Programming (ICALP), LNCS","author":"DJ Lehmann","year":"1981","unstructured":"Lehmann, D.J., Pnueli, A., Stavi, J.: Impartiality, justice and fairness: the ethics of concurrent termination. In: Even, S., Kariv, O. (eds.) Automata, Languages and Programming (ICALP), LNCS, vol. 115, pp. 264\u2013277. Springer, Berlin (1981). doi: 10.1007\/3-540-10843-2_22"},{"key":"221_CR38","doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., Vogler, W.: A faster-than relation for asynchronous processes. In: Larsen, K.G., Nielsen, M. (eds.) Concurrency Theory (CONCUR \u201901), LNCS, vol. 2154, pp. 262\u2013276. Springer (2001). doi: 10.1007\/3-540-44685-0_18","DOI":"10.1007\/3-540-44685-0_18"},{"key":"221_CR39","unstructured":"Lynch, N., Tuttle, M.: An introduction to input, output automata. CWI-Quarterly. 2(3), 219\u2013246. Centrum Voor Wiskunde en Informatica. Amsterdam, The Netherlands (1989)"},{"key":"221_CR40","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"issue":"1","key":"221_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Part I + II. Inf. Comput. 100(1), 1\u201377 (1992). doi: 10.1016\/0890-5401(92)90008-4","journal-title":"Inf. Comput."},{"key":"221_CR42","unstructured":"Nagle, J.: On packet switches with infinite storage. RFC 970, Network Working Group (1985). http:\/\/tools.ietf.org\/rfc\/rfc970.txt"},{"issue":"4","key":"221_CR43","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/TCOM.1987.1096782","volume":"35","author":"J Nagle","year":"1987","unstructured":"Nagle, J.: On packet switches with infinite storage. IEEE Trans. Commun. 35(4), 435\u2013438 (1987). doi: 10.1109\/TCOM.1987.1096782","journal-title":"IEEE Trans. Commun."},{"key":"221_CR44","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526589","volume-title":"Nets, Terms and Formulas: Three Views of Concurrent Processes and their Relationship. No. 23 in Cambridge Tracts in Theoretical Computer Science","author":"E-R Olderog","year":"1991","unstructured":"Olderog, E.-R.: Nets, Terms and Formulas: Three Views of Concurrent Processes and their Relationship. No. 23 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1991)"},{"key":"221_CR45","first-page":"173","volume":"209","author":"J Parrow","year":"2008","unstructured":"Parrow, J.: Expressiveness of process algebras. ENTCS 209, 173\u2013186 (2008). doi: 10.1016\/j.entcs.2008.04.011","journal-title":"ENTCS"},{"issue":"3","key":"221_CR46","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"GL Peterson","year":"1981","unstructured":"Peterson, G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12(3), 115\u2013116 (1981). doi: 10.1016\/0020-0190(81)90106-X","journal-title":"Inf. Process. Lett."},{"key":"221_CR47","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/BFb0012788","volume-title":"Automata, Languages and Programming (ICALP \u201982), LNCS","author":"GD Plotkin","year":"1982","unstructured":"Plotkin, G.D.: A powerdomain for countable non-determinism (extended abstract). In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages and Programming (ICALP \u201982), LNCS, vol. 140, pp. 418\u2013428. Springer, Berlin (1982). doi: 10.1007\/BFb0012788"},{"key":"221_CR48","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Foundations of Computer Science (FOCS \u201977), pp. 46\u201357. IEEE (1977). doi: 10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"issue":"2\u20133","key":"221_CR49","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0167-6423(95)00017-8","volume":"25","author":"KVS Prasad","year":"1995","unstructured":"Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2\u20133), 285\u2013327 (1995). doi: 10.1016\/0167-6423(95)00017-8","journal-title":"Sci. Comput. Program."},{"key":"221_CR50","first-page":"202","volume-title":"Concurrency Theory (CONCUR\u201901), LNCS","author":"A Puhakka","year":"2001","unstructured":"Puhakka, A., Valmari, A.: Liveness and fairness in process-algebraic verification. In: Larsen, K.G., Nielsen, M. (eds.) Concurrency Theory (CONCUR\u201901), LNCS, vol. 2154, pp. 202\u2013217. Springer, Berlin (2001). doi: 10.1007\/3-540-44685-0_14"},{"key":"221_CR51","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-16761-7_81","volume-title":"Automata, Languages and Programming (ICALP \u201986), LNCS","author":"GM Reed","year":"1986","unstructured":"Reed, G.M., Roscoe, A.W.: A timed model for communicating sequential processes. In: Kott, L. (ed.) Automata, Languages and Programming (ICALP \u201986), LNCS, vol. 226, pp. 314\u2013323. Springer, Berlin (1986). doi: 10.1007\/3-540-16761-7_81"},{"key":"221_CR52","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer (1985). doi: 10.1007\/978-3-642-69968-9","DOI":"10.1007\/978-3-642-69968-9"},{"key":"221_CR53","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/3-540-56596-5_49","volume-title":"Proceedings REX Workshop on Semantics: Foundations and Applications, LNCS","author":"FW Vaandrager","year":"1993","unstructured":"Vaandrager, F.W.: Expressiveness results for process algebras. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.) Proceedings REX Workshop on Semantics: Foundations and Applications, LNCS, vol. 666, pp. 609\u2013638. Springer, Berlin (1993). doi: 10.1007\/3-540-56596-5_49"},{"key":"221_CR54","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/3-540-60973-3_90","volume-title":"Industrial Benefit and Advances in Formal Methods (FME\u201996), LNCS","author":"A Valmari","year":"1996","unstructured":"Valmari, A., Set\u00e4l\u00e4, M.: Visual verification of safety and liveness. In: Gaudel, M., Woodcock, J. (eds.) Industrial Benefit and Advances in Formal Methods (FME\u201996), LNCS, vol. 1051, pp. 228\u2013247. Springer, Berlin (1996). doi: 10.1007\/3-540-60973-3_90"},{"key":"221_CR55","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: On specifying timeouts. In: Accetp. L., Gordon, A.D. (eds.) Short Contribution from the Worksho on Algebraic Process Calculi: The First Twenty Five Years and Beyond, ENTCS, vol. 162, pp. 112\u2013223. Elsevier, Amsterdam (2005). doi: 10.1016\/j.entcs.2005.12.083","DOI":"10.1016\/j.entcs.2005.12.083"},{"key":"221_CR56","unstructured":"van Glabbeek, R.J.: Musings on encodings and expressiveness. In: Luttik, B., Reniers, M.A. (eds.) Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, EPTCS, vol. 89, pp. 81\u201398. Open Publishing Association, London (2012). doi: 10.4204\/EPTCS389.7"},{"key":"221_CR57","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: Progress, fairness and justness in process algebra. CoRR abs\/1501.03268(2015). http:\/\/arxiv.org\/abs\/1501.03268"},{"key":"221_CR58","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: Bakker,J.W., Nijman, A.J., Treleaven, P.C. (eds.) Parallel Architectures and Languages Europe (PARLE\u201997), vol. II:Parallel Languages, LNCS. Springer, Berlin (1987). doi: 10.1007\/3-540-17945-3_13","DOI":"10.1007\/3-540-17945-3_13"},{"issue":"13","key":"221_CR59","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1016\/j.ipl.2011.03.013","volume":"111","author":"RJ Glabbeek van","year":"2011","unstructured":"van Glabbeek, R.J., Goltz, U., Schicke, J.W.: Abstract processes of place\/transition systems. Inf. Process. Lett. 111(13), 626\u2013633 (2011). doi: 10.1016\/j.ipl.2011.03.013","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"221_CR60","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/S0304-3975(01)00300-0","volume":"275","author":"W Vogler","year":"2002","unstructured":"Vogler, W.: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theor. Comput. Sci. 275(1\u20132), 589\u2013631 (2002). doi: 10.1016\/S0304-3975(01)00300-0","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"221_CR61","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01887209","volume":"1","author":"DJ Walker","year":"1989","unstructured":"Walker, D.J.: Automated analysis of mutual exclusion algorithms using CCS. Form. Asp. Comput. 1(1), 273\u2013292 (1989). doi: 10.1007\/BF01887209","journal-title":"Form. Asp. Comput."},{"issue":"5","key":"221_CR62","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/253769.253801","volume":"40","author":"P Wegner","year":"1997","unstructured":"Wegner, P.: Why interaction is more powerful than algorithms. Commun. ACM 40(5), 80\u201391 (1997). doi: 10.1145\/253769.253801","journal-title":"Commun. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0221-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0221-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0221-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:58Z","timestamp":1558705318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0221-6"}},"subtitle":["Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions"],"short-title":[],"issued":{"date-parts":[[2015,3,19]]},"references-count":62,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["221"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0221-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,19]]}}}