{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:10:32Z","timestamp":1750824632016,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631202"},{"type":"electronic","value":"9783319631219"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63121-9_17","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T08:05:15Z","timestamp":1500883515000},"page":"339-366","source":"Crossref","is-referenced-by-count":0,"title":["Testing Divergent Transition Systems"],"prefix":"10.1007","author":[{"given":"Ed","family":"Brinksma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle I. A.","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Timmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"issue":"3","key":"17_CR1","first-page":"103","volume":"17","author":"J Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs outputs and repetitive quiescence. Softw. \u2013 Concepts Tools 17(3), 103\u2013120 (1996)","journal-title":"Softw. \u2013 Concepts Tools"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-38916-0_13","volume-title":"Tests and Proofs","author":"WGJ Stokkink","year":"2013","unstructured":"Stokkink, W.G.J., Timmer, M., Stoelinga, M.I.A.: Divergent quiescent transition systems. In: Veanes, M., Vigan\u00f2, L. (eds.) TAP 2013. LNCS, vol. 7942, pp. 214\u2013231. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38916-0_13"},{"key":"17_CR3","first-page":"219","volume":"2","author":"NA Lynch","year":"1989","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to input\/output automata. CWI Q. 2, 219\u2013246 (1989)","journal-title":"CWI Q."},{"key":"17_CR4","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Timmer, M., Brinksma, E., Stoelinga, M.I.A.: Model-based testing. In: Software and Systems Safety: Specification and Verification. NATO Science for Peace and Security Series D, vol. 30, pp. 1\u201332. IOS Press, Amsterdam (2011)","DOI":"10.3233\/978-1-60750-711-6-1"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W.: On the relationship between process algebra and input\/output automata (extended abstract). In: Proceedings of the 6th Annual Symposium on Logic in Computer Science (LICS), pp. 387\u2013398. IEEE Computer Society (1991)","DOI":"10.1109\/LICS.1991.151662"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-61042-1_42","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs, outputs, and quiescence. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 127\u2013146. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61042-1_42"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78917-8_1","volume-title":"Formal Methods and Testing","author":"J Tretmans","year":"2008","unstructured":"Tretmans, J.: Model based testing with labelled transition systems. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) Formal Methods and Testing. LNCS, vol. 4949, pp. 1\u201338. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78917-8_1"},{"issue":"4","key":"17_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10009-004-0153-x","volume":"7","author":"C Jard","year":"2005","unstructured":"Jard, C., J\u00e9ron, T.: TGV: theory, principles and algorithms. Int. J. Softw. Tools Technol. Transf. 7(4), 297\u2013315 (2005)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 137\u2013151. ACM (1987)","DOI":"10.1145\/41840.41852"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0304-3975(95)92307-J","volume":"138","author":"R Nicola De","year":"1995","unstructured":"De Nicola, R., Segala, R.: A process algebraic view of input\/output automata. Theor. Comput. Sci. 138, 391\u2013423 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms (working paper). In: Proceedings of the 12th Annual Symposium on Switching and Automata Theory (SWAT), pp. 114\u2013121. IEEE Computer Society (1971)","DOI":"10.1109\/SWAT.1971.10"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Stoelinga, M., Timmer, M.: Interpreting a successful testing process: risk and actual coverage. In: Proceedings of the 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE), pp. 251\u2013258. IEEE Computer Society (2009)","DOI":"10.1109\/TASE.2009.26"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Stokkink, W.G.J., Timmer, M., Stoelinga, M.I.A.: Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation. In: Proceedings of the 7th Workshop on Model-Based Testing (MBT). EPTCS, vol. 80, pp. 73\u201387 (2012)","DOI":"10.4204\/EPTCS.80.6"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Stokkink, W.G.J., Timmer, M., Stoelinga, M.I.A.: Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation (extended version). Technical report TR-CTIT-12-05, University of Twente (2012)","DOI":"10.4204\/EPTCS.80.6"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Stokkink, G.: Quiescent transition systems. Master\u2019s thesis, University of Twente (2012)","DOI":"10.1007\/978-3-642-38916-0_13"}],"container-title":["Lecture Notes in Computer Science","Models, Algorithms, Logics and Tools"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63121-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T17:32:32Z","timestamp":1750786352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63121-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631202","9783319631219"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63121-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}