{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:04:58Z","timestamp":1762297498339},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_19","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T12:27:08Z","timestamp":1251721628000},"page":"274-288","source":"Crossref","is-referenced-by-count":42,"title":["Testing Finitary Probabilistic Processes"],"prefix":"10.1007","author":[{"given":"Yuxin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Glabbeek","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[]},{"given":"Carroll","family":"Morgan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C.: Characterising testing preorders for finite probabilistic processes. Logical Methods in Computer Science\u00a04(4:4) (2008)","DOI":"10.2168\/LMCS-4(4:4)2008"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C.: Testing finitary probabilistic processes. Full version of this extended abstract (2009), http:\/\/www.cse.unsw.edu.au\/~rvg\/pub\/finitary.pdf","DOI":"10.1007\/978-3-642-04081-8_19"},{"key":"19_CR3","first-page":"359","volume":"172","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.C., Zhang, C.: Remarks on testing probabilistic processes. ENTCS\u00a0172, 359\u2013397 (2007)","journal-title":"ENTCS"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-71316-6_25","volume-title":"Programming Languages and Systems","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., van Glabbeek, R.J., Morgan, C.C., Zhang, C.: Scalar outcomes suffice for finitary probabilistic testing. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 363\u2013378. Springer, Heidelberg (2007)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45694-5_24","volume-title":"CONCUR 2002 - Concurrency Theory","author":"J. Desharnais","year":"2002","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panagaden, P.: Weak bisimulation is sound and complete for PCTL*. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 355\u2013370. Springer, Heidelberg (2002)"},{"key":"19_CR7","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"19_CR8","unstructured":"Jones, C.: Probabilistic Non-determinism. Ph.D. Thesis, University of Edinburgh (1990)"},{"key":"19_CR9","volume-title":"Schaum\u2019s outline of theory and problems of general topology","author":"S. Lipschutz","year":"1965","unstructured":"Lipschutz, S.: Schaum\u2019s outline of theory and problems of general topology. McGraw-Hill, New York (1965)"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/S0097539704446487","volume":"37","author":"N. Lynch","year":"2007","unstructured":"Lynch, N., Segala, R., Vaandrager, F.W.: Observing branching structure through probabilistic contexts. SIAM Journal on Computing\u00a037(4), 977\u20131013 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR11","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"A.K. McIver","year":"2005","unstructured":"McIver, A.K., Morgan, C.C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer, Heidelberg (2005)"},{"key":"19_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"19_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"M. Puterman","year":"1994","unstructured":"Puterman, M.: Markov Decision Processes. Wiley, Chichester (1994)"},{"key":"19_CR14","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: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 299\u2013314. Springer, Heidelberg (1996)"},{"key":"19_CR15","series-title":"IFIP Transactions C-8","first-page":"47","volume-title":"Proc. PSTV 1992","author":"W. Yi","year":"1992","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Proc. PSTV 1992. IFIP Transactions C-8, pp. 47\u201361. North-Holland, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:47:07Z","timestamp":1558500427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}