{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:20Z","timestamp":1761597020722},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660101"},{"type":"electronic","value":"9783540487784"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48778-6_8","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T06:18:07Z","timestamp":1178000287000},"page":"130-150","source":"Crossref","is-referenced-by-count":3,"title":["An Axiomatization of Probabilistic Testing"],"prefix":"10.1007","author":[{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1995.1135","volume":"121","author":"J.C.M. Baeten","year":"1995","unstructured":"J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 121(2):234\u2013255, 1995.","journal-title":"Information and Computation"},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Computer Aided Verification\u201997","author":"C. Baier","year":"1997","unstructured":"C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. In Computer Aided Verification\u201997, LNCS 1254, pages 119\u2013130. Springer, 1997."},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0039056","volume-title":"CONCUR\u201990","author":"I. Christoff","year":"1990","unstructured":"I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In CONCUR\u201990, LNCS 458, pages 126\u2013140. Springer, 1990."},{"key":"8_CR4","unstructured":"R. Cleaveland, I. Lee, P. Lewis, and S.A. Smolka. A theory of testing for soft real-time processes. In 8th International Conference on Software Engineering and Knowledge Engineering, 1996."},{"key":"8_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1007\/3-540-55719-9_116","volume-title":"19th ICALP","author":"R. Cleaveland","year":"1992","unstructured":"R. Cleaveland, S.A. Smolka, and A.E. Zwarico. Testing preorders for probabilistic processes. In 19th ICALP, LNCS 623, pages 708\u2013719. Springer, 1992."},{"key":"8_CR6","series-title":"Lect Notes Comput Sci","first-page":"340","volume-title":"4th International AMAST Workshop on Real-Time Systems, Concurrent and Distributed Software","author":"F. Cuartero","year":"1997","unstructured":"F. Cuartero, D. de Frutos, and V. Valero. A sound and complete proof system for probabilistic processes. In 4th International AMAST Workshop on Real-Time Systems, Concurrent and Distributed Software, LNCS 1231, pages 340\u2013352. Springer, 1997."},{"key":"8_CR7","unstructured":"P.R. D\u2019Argenio, H. Hermanns, and J.-P. Katoen. On generative parallel composition. In Workshop on Probabilistic Methods in Verification, PROBMIV\u201998, pages 105\u2013121, 1998."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","unstructured":"A. Giacalone, C.-C. Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2. North Holland, 1990."},{"key":"8_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-63010-4_24","volume-title":"4th International AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software","author":"C. Gregorio","year":"1997","unstructured":"C. Gregorio, L. Llana, M. N\u00fa\u00f1ez, and P. Palao. Testing semantics for a probabilistic-timed process algebra. In 4th International AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, LNCS 1231, pages 353\u2013367. Springer, 1997."},{"key":"8_CR11","unstructured":"C. Gregorio and M. N\u00fa\u00f1ez. Denotational semantics for probabilistic refusal testing. In Workshop on Probabilistic Methods in Verification, PROBMIV\u201998, pages 123\u2013137, 1998."},{"key":"8_CR12","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"8_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"CONCUR\u201990","author":"C.-C. Jou","year":"1990","unstructured":"C.-C. Jou and S.A. Smolka. Equivalences, congruences and complete axiomatizations for probabilistic processes. In CONCUR\u201990, LNCS 458, pages 367\u2013383. Springer, 1990."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1\u201328, 1991.","journal-title":"Information and Computation"},{"key":"8_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/BFb0084809","volume-title":"CONCUR\u201992","author":"K.G. Larsen","year":"1992","unstructured":"K.G. Larsen and A. Skou. Compositional verification of probabilistic processes. In CONCUR\u201992, LNCS 630, pages 456\u2013471. Springer, 1992."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(94)00171-E","volume":"138","author":"G. Lowe","year":"1995","unstructured":"G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138:315\u2013352, 1995.","journal-title":"Theoretical Computer Science"},{"key":"8_CR17","unstructured":"M. N\u00fa\u00f1ez. Sem\u00e1nticas de Pruebas para \u00c1lgebras de Procesos Probabil\u015bticos. PhD thesis, Universidad Complutense de Madrid, 1996."},{"key":"8_CR18","unstructured":"M. N\u00fa\u00f1ez and D. de Frutos. Testing semantics for probabilistic LOTOS. In Formal Description Techniques VIII, pages 365\u2013380. Chapman & Hall, 1995."},{"key":"8_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-60218-6_18","volume-title":"CONCUR\u201995","author":"M. N\u00fa\u00f1ez","year":"1995","unstructured":"M. N\u00fa\u00f1ez, D. de Frutos, and L. Llana. Acceptance trees for probabilistic processes. In CONCUR\u201995, LNCS 962, pages 249\u2013263. Springer, 1995."},{"key":"8_CR20","unstructured":"E.W. Stark and S.A. Smolka. A complete axiom system for finite-state probabilistic processes, 1996."},{"key":"8_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BFb0039078","volume-title":"CONCUR\u201990","author":"C. Tofts","year":"1990","unstructured":"C. Tofts. A synchronous calculus of relative frequency. In CONCUR\u201990, LNCS 458, pages 467\u2013480. Springer, 1990."},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. Glabbeek","year":"1995","unstructured":"R. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121(1):59\u201380, 1995.","journal-title":"Information and Computation"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"W. Yi and K.G. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing and Verification XII, pages 47\u201361. North Holland, 1992.","DOI":"10.1016\/B978-0-444-89874-6.50010-6"},{"key":"8_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-540-48654-1_36","volume-title":"CONCUR\u201994","author":"S. Yuen","year":"1994","unstructured":"S. Yuen, R. Cleaveland, Z. Dayar, and S.A. Smolka. Fully abstract characterizations of testing preorders for probabilistic processes. In CONCUR\u201994, LNCS 836, pages 497\u2013512. Springer, 1994."}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Real-Time and Probabilistic Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48778-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:38:41Z","timestamp":1550302721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48778-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660101","9783540487784"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-48778-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}