{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:51:19Z","timestamp":1725511879009},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713142"},{"type":"electronic","value":"9783540713166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71316-6_25","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:58:28Z","timestamp":1184590708000},"page":"363-378","source":"Crossref","is-referenced-by-count":16,"title":["Scalar Outcomes Suffice for Finitary Probabilistic Testing"],"prefix":"10.1007","author":[{"given":"Yuxin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Glabbeek","sequence":"additional","affiliation":[]},{"given":"Carroll","family":"Morgan","sequence":"additional","affiliation":[]},{"given":"Chenyi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","first-page":"1","volume-title":"Handbook of Logic and Computer Science, vol. 3","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic and Computer Science, vol. 3, pp. 1\u2013168. Clarendon Press, Oxford (1994)"},{"key":"25_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03961-8","volume-title":"Infinite Dimensional Analysis","author":"C.D. Aliprantis","year":"1999","unstructured":"Aliprantis, C.D., Border, K.C.: Infinite Dimensional Analysis, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45694-5_25","volume-title":"CONCUR 2002 - Concurrency Theory","author":"S. Cattani","year":"2002","unstructured":"Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation. In: Brim, L., et al. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"25_CR4","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":"25_CR5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/REAL.1990.128759","volume-title":"Proc. of the Real-Time Systems Symposium (RTSS \u201990)","author":"H. Hansson","year":"1990","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proc. of the Real-Time Systems Symposium (RTSS \u201990), pp. 278\u2013287. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6423(96)00019-6","volume":"28","author":"J. He","year":"1997","unstructured":"He, J., Seidel, K., McIver, A.K.: Probabilistic models for the guarded command language. Science of Computer Programming\u00a028, 171\u2013192 (1997)","journal-title":"Science of Computer Programming"},{"key":"25_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":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/3-540-58468-4_176","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"B. Jonsson","year":"1994","unstructured":"Jonsson, B., Ho-Stuart, C., Yi, W.: Testing and refinement for nondeterministic and probabilistic processes. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 418\u2013430. Springer, Heidelberg (1994)"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(01)00044-5","volume":"282","author":"B. Jonsson","year":"2002","unstructured":"Jonsson, B., Yi, W.: Testing preorders for probabilistic processes can be characterized by simulations. Theoretical Computer Science\u00a0282(1), 33\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(85)90012-1","volume":"30","author":"D. Kozen","year":"1985","unstructured":"Kozen, D.: A probabilistic PDL. Jnl. Comp. Sys. Sciences\u00a030(2), 162\u2013178 (1985)","journal-title":"Jnl. Comp. Sys. Sciences"},{"key":"25_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)"},{"key":"25_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-36078-6_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A.K. McIver","year":"2002","unstructured":"McIver, A.K., Morgan, C.C.: Games, probability and the quantitative \u03bc-calculus qMu. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 292\u2013310. Springer, Heidelberg (2002)"},{"key":"25_CR13","series-title":"Tech. Mono. Comp. Sci","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. Tech. Mono. Comp. Sci. Springer, Heidelberg (2005)"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C.C. Morgan","year":"1996","unstructured":"Morgan, C.C., McIver, A.K., Seidel, K.: Probabilistic predicate transformers. ACM Trans. on Programming Languages and Systems\u00a018(3), 325\u2013353 (1996)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-44618-4_25","volume-title":"CONCUR 2000 - Concurrency Theory","author":"A. Philippou","year":"2000","unstructured":"Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 334\u2013349. Springer, Heidelberg (2000)"},{"key":"25_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes. Wiley, Chichester (1994)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BFb0015027","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Segala","year":"1994","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 481\u2013496. Springer, Heidelberg (1994)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-45061-0_38","volume-title":"Automata, Languages and Programming","author":"M.I.A. Stoelinga","year":"2003","unstructured":"Stoelinga, M.I.A., Vaandrager, F.W.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., et al. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 407\u2013418. Springer, Heidelberg (2003)"},{"key":"25_CR20","first-page":"327","volume-title":"Proc. FOCS \u201985","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: Proc. FOCS \u201985, pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"25_CR21","series-title":"IFIP Transactions","first-page":"47","volume-title":"Proc. IFIP TC6\/WG6.1 Twelfth Intern. Symp. on Protocol Specification, Testing and Verification","author":"W. Yi","year":"1992","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Proc. IFIP TC6\/WG6.1 Twelfth Intern. Symp. on Protocol Specification, Testing and Verification. IFIP Transactions, vol.\u00a0C-8, pp. 47\u201361. North-Holland, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71316-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T22:10:46Z","timestamp":1550441446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71316-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540713142","9783540713166"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71316-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}