{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:42Z","timestamp":1762459002930,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_13","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"195-209","source":"Crossref","is-referenced-by-count":5,"title":["Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes"],"prefix":"10.1007","author":[{"given":"Marco","family":"Bernardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocco","family":"De Nicola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Loreti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"Abramsky, S.: Observational equivalence as a testing equivalence. Theoretical Computer Science\u00a053, 225\u2013241 (1987)","journal-title":"Theoretical Computer Science"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. Brookes","year":"1984","unstructured":"Brookes, S., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM\u00a031, 560\u2013599 (1984)","journal-title":"Journal of the ACM"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0039056","volume-title":"CONCUR \u201990","author":"I. Christoff","year":"1990","unstructured":"Christoff, I.: Testing Equivalences and Fully Abstract Models for Probabilistic Processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 126\u2013140. Springer, Heidelberg (1990)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.1999.2808","volume":"154","author":"R. Cleaveland","year":"1999","unstructured":"Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing preorders for probabilistic processes. Information and Computation\u00a0154, 93\u2013148 (1999)","journal-title":"Information and Computation"},{"key":"13_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"},{"issue":"4","key":"13_CR6","first-page":"1","volume":"4","author":"Y. Deng","year":"2008","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. LMCS\u00a04(4), 1\u201333 (2008)","journal-title":"LMCS"},{"key":"13_CR7","unstructured":"Derman, C.: Finite State Markovian Decision Processes. Academic Press (1970)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-12032-9_7","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Georgievska","year":"2010","unstructured":"Georgievska, S., Andova, S.: Retaining the Probabilities in Probabilistic Testing Theory. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 79\u201393. Springer, Heidelberg (2010)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proc. of RTSS\u00a01990, pp. 278\u2013287. IEEE-CS Press (1990)","DOI":"10.1109\/REAL.1990.128759"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Yi, W.: Compositional testing preorders for probabilistic processes. In: Proc. of LICS\u00a01995, pp. 431\u2013441. IEEE-CS Press (1995)","DOI":"10.1109\/LICS.1995.523277"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G.: A testing equivalence for reactive probabilistic processes. In: Proc. of EXPRESS\u00a01998. ENTCS, vol.\u00a016(2), pp. 114\u2013132 (1998)","DOI":"10.1016\/S1571-0661(04)00121-5"},{"key":"13_CR12","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD Thesis (1995)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-60218-6_17","volume-title":"CONCUR \u201995 Concurrency Theory","author":"R. Segala","year":"1995","unstructured":"Segala, R.: A Compositional Trace-Based Semantics for Probabilistic Automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 234\u2013248. Springer, Heidelberg (1995)"},{"key":"13_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":"13_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R.J. Glabbeek van","year":"1995","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation\u00a0121, 59\u201380 (1995)","journal-title":"Information and Computation"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of FOCS\u00a01985, pp. 327\u2013338. IEEE-CS Press (1985)","DOI":"10.1109\/SFCS.1985.12"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Proc. of PSTV\u00a01992, 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 Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T18:49:24Z","timestamp":1742755764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}