{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:28:42Z","timestamp":1794356922016,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540688549","type":"print"},{"value":"9783540688556","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-68855-6_17","type":"book-chapter","created":{"date-parts":[[2008,5,31]],"date-time":"2008-05-31T05:18:13Z","timestamp":1212211093000},"page":"267-282","source":"Crossref","is-referenced-by-count":1,"title":["A Hierarchy of Equivalences for Probabilistic Processes"],"prefix":"10.1007","author":[{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luis","family":"Llana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Cambridge Tracts in Computer Science 18","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. In: Cambridge Tracts in Computer Science 18, Cambridge University Press, Cambridge (1990)"},{"key":"17_CR2","volume-title":"Handbook of Process Algebra","year":"2001","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland, Amsterdam (2001)"},{"issue":"1\u20132","key":"17_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S1567-8326(02)00040-1","volume":"55","author":"D. Cazorla","year":"2003","unstructured":"Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming\u00a055(1\u20132), 57\u2013103 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Cheung, L., Stoelinga, M., Vaandrager, F.: A testing scenario for probabilistic processes. Journal of the ACM\u00a054(6), Article 29 (2007)","DOI":"10.1145\/1314690.1314693"},{"key":"17_CR5","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)"},{"issue":"2","key":"17_CR6","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(2), 93\u2013148 (1999)","journal-title":"Information and Computation"},{"key":"17_CR7","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.C.B.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"17_CR8","first-page":"313","volume-title":"22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C., Zhang, C.: Characterising testing preorders for finite probabilistic processes. In: 22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007, pp. 313\u2013325. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.: The linear time-branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"17_CR10","volume-title":"Handbook of process algebra, ch. 1","author":"R. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.: The linear time-branching time spectrum I. The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of process algebra, ch. 1, North-Holland, Amsterdam (2001)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. Glabbeek van","year":"1995","unstructured":"van Glabbeek, R., 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":"17_CR12","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"PROBMIV 1998","author":"C. Gregorio","year":"1999","unstructured":"Gregorio, C., N\u00fa\u00f1ez, M.: Denotational semantics for probabilistic refusal testing. In: PROBMIV 1998. Electronic Notes in Theoretical Computer Science, vol.\u00a022. Elsevier, Amsterdam (1999)"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M.: Acceptance trees. Journal of the ACM\u00a032(4), 896\u2013928 (1985)","journal-title":"Journal of the ACM"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(87)90004-1","volume":"49","author":"M. Hennessy","year":"1987","unstructured":"Hennessy, M.: An algebraic theory of fair asynchronous communicating processes. Theoretical Computer Science\u00a049, 121\u2013143 (1987)","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"key":"17_CR16","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":"17_CR17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3233\/FI-1992-17304","volume":"17","author":"D.T. Huynh","year":"1992","unstructured":"Huynh, D.T., Tian, L.: On some equivalence relations for probabilistic processes. Fundamenta Informaticae\u00a017, 211\u2013234 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR18","first-page":"431","volume-title":"10th IEEE Symposium on Logic In Computer Science","author":"B. Jonsson","year":"1995","unstructured":"Jonsson, B., Yi, W.: Compositional testing preorders for probabilistic processes. In: 10th IEEE Symposium on Logic In Computer Science, pp. 431\u2013443. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"17_CR19","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, 33\u201351 (2002)","journal-title":"Theoretical Computer Science"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"CONCUR \u201990","author":"C.-C. Jou","year":"1990","unstructured":"Jou, C.-C., Smolka, S.A.: Equivalences, congruences and complete axiomatizations for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 367\u2013383. Springer, Heidelberg (1990)"},{"key":"17_CR21","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"EXPRESS 1998","author":"M. Kwiatkowska","year":"1998","unstructured":"Kwiatkowska, M., Norman, G.J.: A testing equivalence for reactive probabilistic processes. In: EXPRESS 1998. Electronic Notes in Theoretical Computer Science, vol.\u00a016. Elsevier, Amsterdam (1998)"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-24611-4_3","volume-title":"Validation of Stochastic Systems","author":"N. L\u00f3pez","year":"2004","unstructured":"L\u00f3pez, N., N\u00fa\u00f1ez, M.: An overview of probabilistic process algebras and their equivalences. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 89\u2013123. Springer, Heidelberg (2004)"},{"key":"17_CR24","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"17_CR25","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-49382-2_19","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"K. Narayan Kumar","year":"1998","unstructured":"Narayan Kumar, K., Cleaveland, R., Smolka, S.A.: Infinite probabilistic and nonprobabilistic testing. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 209\u2013220. Springer, Heidelberg (1998)"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/3-540-60084-1_112","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, pp. 648\u2013659. Springer, Heidelberg (1995)"},{"issue":"1\u20132","key":"17_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S1567-8326(02)00069-3","volume":"56","author":"M. N\u00fa\u00f1ez","year":"2003","unstructured":"N\u00fa\u00f1ez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming\u00a056(1\u20132), 117\u2013177 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"17_CR29","first-page":"365","volume-title":"8th IFIP WG6.1 Int. Conf. on Formal Description Techniques, FORTE 1995","author":"M. N\u00fa\u00f1ez","year":"1995","unstructured":"N\u00fa\u00f1ez, M., de Frutos, D.: Testing semantics for probabilistic LOTOS. In: 8th IFIP WG6.1 Int. Conf. on Formal Description Techniques, FORTE 1995, pp. 365\u2013380. Chapman & Hall, Boca Raton (1995)"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-60218-6_18","volume-title":"CONCUR \u201995 Concurrency Theory","author":"M. N\u00fa\u00f1ez","year":"1995","unstructured":"N\u00fa\u00f1ez, M., de Frutos, D., Llana, L.: Acceptance trees for probabilistic processes. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 249\u2013263. Springer, Heidelberg (1995)"},{"key":"17_CR31","first-page":"135","volume-title":"Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX)","author":"M. N\u00fa\u00f1ez","year":"1999","unstructured":"N\u00fa\u00f1ez, M., Rup\u00e9rez, D.: Fair testing through probabilistic testing. In: Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pp. 135\u2013150. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"2","key":"17_CR32","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A. Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Information and Computation\u00a0205(2), 125\u2013198 (2007)","journal-title":"Information and Computation"},{"key":"17_CR33","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":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-45061-0_38","volume-title":"Automata, Languages and Programming","author":"M. Stoelinga","year":"2003","unstructured":"Stoelinga, M., Vaandrager, F.: A testing scenario for probabilistic automata. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 464\u2013477. Springer, Heidelberg (2003)"},{"key":"17_CR35","first-page":"47","volume-title":"12th IFIP\/WG6.1 Int. Symposium on Protocol Specification, Testing and Verification, PSTV 1992","author":"W. Yi","year":"1992","unstructured":"Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: 12th IFIP\/WG6.1 Int. Symposium on Protocol Specification, Testing and Verification, PSTV 1992, pp. 47\u201361. North-Holland, Amsterdam (1992)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68855-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T08:39:02Z","timestamp":1631349542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68855-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540688549","9783540688556"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68855-6_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-68855-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}