{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:38:52Z","timestamp":1743097132769,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031156281"},{"type":"electronic","value":"9783031156298"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15629-8_30","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:26:53Z","timestamp":1664036813000},"page":"559-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Must Testing for\u00a0I\/O Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4712-7423","authenticated-orcid":false,"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"CONCUR \u201995: Concurrency Theory","author":"E Brinksma","year":"1995","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 313\u2013327. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60218-6_23"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoret. Comput. Sci. 34, 83\u2013133 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90113-0","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.2168\/LMCS-4(4:4)2008","volume":"4","author":"Y Deng","year":"2008","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C.: Characterising testing preorders for finite probabilistic processes. Log. Methods Comput. Sci. 4(4), 4 (2008). https:\/\/doi.org\/10.2168\/LMCS-4(4:4)2008","journal-title":"Log. Methods Comput. Sci."},{"key":"30_CR4","unstructured":"van Glabbeek, R.J.: Just testing. https:\/\/theory.stanford.edu\/~rvg\/abstracts.html#160"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-030-17127-8_29","volume-title":"Foundations of Software Science and Computation Structures","author":"RJ van Glabbeek","year":"2019","unstructured":"van Glabbeek, R.J.: Justness: a completeness criterion for capturing liveness properties (extended abstract). In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 505\u2013522. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_29"},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Reward testing equivalences for processes. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds.) Models, Languages, and Tools for Concurrent and Distributed Programming. LNCS, vol. 11665, pp. 45\u201370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21485-2_5","DOI":"10.1007\/978-3-030-21485-2_5"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/3329125","volume":"52","author":"RJ van Glabbeek","year":"2019","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: Progress, justness and fairness. ACM Comput. Surv. 52(4), 69 (2019). https:\/\/doi.org\/10.1145\/3329125","journal-title":"ACM Comput. Surv."},{"key":"30_CR8","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Hoboken (1985)"},{"key":"30_CR9","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to input\/output automata. CWI Q. 2(3), 219\u2013246 (1989). https:\/\/groups.csail.mit.edu\/tds\/papers\/Lynch\/CWI89.pdf"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/3-540-60084-1_112","volume-title":"Automata, Languages and Programming","author":"V Natarajan","year":"1995","unstructured":"Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 648\u2013659. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60084-1_112"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-61604-7_62","volume-title":"CONCUR \u201996: Concurrency Theory","author":"R Segala","year":"1996","unstructured":"Segala, R.: Testing probabilistic automata. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 299\u2013314. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61604-7_62"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/inco.1997.2652","volume":"138","author":"R Segala","year":"1997","unstructured":"Segala, R.: Quiescence, fairness, testing, and the notion of implementation. Inf. Comput. 138(2), 194\u2013210 (1997). https:\/\/doi.org\/10.1006\/inco.1997.2652","journal-title":"Inf. Comput."},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Vaandrager, F.W.: On the relationship between process algebra and input\/output automata. In: Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS 1991), Amsterdam, The Netherlands, 15\u201318 July 1991. IEEE Computer Society, pp. 387\u2013398 (1991). https:\/\/doi.org\/10.1109\/LICS.1991.151662","DOI":"10.1109\/LICS.1991.151662"}],"container-title":["Lecture Notes in Computer Science","A Journey from Process Algebra via Timed Automata to Model Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15629-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:32:43Z","timestamp":1664037163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15629-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031156281","9783031156298"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15629-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}