{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:06Z","timestamp":1762458966188},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615507"},{"type":"electronic","value":"9783540705970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61550-4_167","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:54:53Z","timestamp":1330275293000},"page":"419-430","source":"Crossref","is-referenced-by-count":11,"title":["Probabilistic metric semantics for a simple language with recursion"],"prefix":"10.1007","author":[{"given":"Marta","family":"Kwiatkowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gethin","family":"Norman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"P.H.M.America and J.J.M.M.Rutten. Solving reflexive domain equations in a category of complete metric spaces, JCSS, 39, no.3, 1989.","DOI":"10.1016\/0022-0000(89)90027-5"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"J.C.M.Baeten, J.A.Bergstra and S.A.Smolka. Axiomatising probabilistic processes: ACP with generative probability, Proc. Concur'92, LNCS, 630, Springer, 1992.","DOI":"10.1007\/BFb0084810"},{"key":"32_CR3","unstructured":"C.Baier and M.Kwiatkowska. Domain equations for probabilistic processes, preprint."},{"key":"32_CR4","unstructured":"I.Christoff. Testing equivalences and fully abstract models for probabilistic processes, Proc. Concur'90, LNCS, 458, Springer, 1990."},{"key":"32_CR5","unstructured":"J.W.de Bakker and J.I.Zucker. Processes and the denotational semantics of concurrency, Information and Control, 1\/2, 1984."},{"key":"32_CR6","unstructured":"A.Giacalone, C.-C.Jou and S.A.Smolka. Algebraic reasoning for probabilistic concurrent systems, In Proc. Programming Concepts and Methods, IFIP, 1990."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"M.Gro\u00dfe-Rhode and H.Ehrig. Transformation of combined data type and process specifications using projection algebras, LNCS, 430, Springer, 1989.","DOI":"10.1007\/3-540-51722-7_11"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"C.A.Hoare. Communicating sequential processes, Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"32_CR9","unstructured":"C.Jones. Probabilistic non-determinism, PhD Thesis, University of Edinburgh, 1990."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"B.Jonsson and K.G.Larsen. Specification and refinement of probabilistic processes, Proc. IEEE Logic in Computer Science (LICS), 1991.","DOI":"10.1109\/LICS.1991.151651"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"B.Jonsson and Wang Yi. Compositional testing preorders for probabilistic processes, Proc. IEEE Logic in Computer Science (LICS), 1995.","DOI":"10.1109\/LICS.1995.523277"},{"key":"32_CR12","unstructured":"C.-C.Jou and S.Smolka. Equivalences, congruences and complete axiomatizations for probabilistic processes, Proc. Concur'90, LNCS, 458, Springer, 1990."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"D.Kozen. Semantics of probabilistic programs, Proc. IEEE Symposium on Foundations of Computer Science (FOCS), 1979.","DOI":"10.1109\/SFCS.1979.38"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"K.G.Larsen and A.Skou. Bisimulation through probabilistic testing, Information and Computation, 94, 1991.","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"32_CR15","unstructured":"K.G.Larsen and A.Skou. Compositional verification of probabilistic processes, Proc. Concur'92, LNCS, 630, Springer, 1992."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"R.Milner. Calculi for synchrony and asynchrony, TCS, 25(3), 1983.","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"32_CR17","unstructured":"R.Milner. Communication and concurrency, Prentice Hall, 1989."},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"K.Seidel. Probabilistic communicating processes, TCS, 152, 1995.","DOI":"10.1016\/0304-3975(94)00286-0"},{"key":"32_CR19","unstructured":"C.Tofts. A synchronous calculus of relative frequency, Proc. Concur'90, LNCS, 458, Springer, 1990."},{"key":"32_CR20","unstructured":"R.J.van Glabbeek, S.A.Smolka, B.Steffen and C.Tofts. Reactive, generative and stratified models of probabilistic processes, Proc. Concur'92, LNCS, 630, Springer, 1992."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"S.Yuen, R.Cleaveland, Z.Dayar and S.A.Smolka. Fully abstract characterizations of testing preorders for probabilistic processes, Proc. Concur'94, LNCS, 836, Springer, 1994.","DOI":"10.1007\/978-3-540-48654-1_36"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61550-4_167.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:34:10Z","timestamp":1619559250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61550-4_167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615507","9783540705970"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-61550-4_167","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}