{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:34:07Z","timestamp":1761597247800},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_19","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T04:37:34Z","timestamp":1294461454000},"page":"209-220","source":"Crossref","is-referenced-by-count":7,"title":["Infinite Probabilistic and Nonprobabilistic Testing"],"prefix":"10.1007","author":[{"given":"K. Narayan","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60630-0","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.\u00a0962. Springer, Heidelberg (1995)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S., Zwarico, A.: Testing preorders for probabilistic processes. Information and Computation (1998) (to Appear)","DOI":"10.1006\/inco.1999.2808"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1983","unstructured":"De Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1983)","journal-title":"Theoretical Computer Science"},{"key":"19_CR4","volume-title":"Probability Theory and its Applications","author":"W. Feller","year":"1950","unstructured":"Feller, W.: Probability Theory and its Applications. John Wiley and Sons, Chichester (1950)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R.J. Glabbeek","year":"1995","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Information and Computation\u00a0121(1), 59\u201380 (1995)","journal-title":"Information and Computation"},{"key":"19_CR6","volume-title":"Algebraic Theory of Processes","author":"M.C.B. Hennessy","year":"1988","unstructured":"Hennessy, M.C.B.: Algebraic Theory of Processes. MIT Press, Boston (1988)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Yi, W.: Compositional testing preorders for probabilistic processes. In: Proceedings of LICS 1995, pp. 431\u2013441 (1995)","DOI":"10.1109\/LICS.1995.523277"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","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., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944. Springer, Heidelberg (1995)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201996: Concurrency Theory","author":"R. Segala","year":"1996","unstructured":"Segala, R.: Testing probabilistic automata. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119. Springer, Heidelberg (1996)"},{"key":"19_CR10","volume-title":"Probability. Graduate Texts in Mathematics","author":"A.N. Shiryayev","year":"1980","unstructured":"Shiryayev, A.N.: Probability. Graduate Texts in Mathematics. Springer, Heidelberg (1980)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I\/O automata. Theoretical Computer Science\u00a0176 (1997)","DOI":"10.1016\/S0304-3975(97)00056-X"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Protocol Specification, Testing and Verification, vol.\u00a0XII, pp. 47\u201361. North-Holland (1992)","DOI":"10.1016\/B978-0-444-89874-6.50010-6"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:06:46Z","timestamp":1559930806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}