{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:12:22Z","timestamp":1760170342520},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055794","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"446-455","source":"Crossref","is-referenced-by-count":15,"title":["Probabilistic concurrent constraint programming: Towards a fully abstract model"],"prefix":"10.1007","author":[{"given":"Alessandra","family":"Di Pierro","sequence":"first","affiliation":[]},{"given":"Herbert","family":"Wiklicky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"F. S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and Infinite Computations in Constraint Programming. Theoretical Computer Science, 151(1), 1995. Selected Papers of the Workshop on Topology and Completion in Semantics, Chartres, France.","DOI":"10.1016\/0304-3975(95)00047-Z"},{"key":"41_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S1571-0661(05)80167-7","volume":"6","author":"F. S. Boer de","year":"1997","unstructured":"F. S. de Boer and M. Gabbrielli. Infinite Computations in Concurrent Constraint Programming. Electronic Notes in Theoretical Computer Science, 6:16, 1997.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"F.S. de Boer and C. Palamidessi. A Fully Abstract Model for Concurrent Constraint Programming. In S. Abramsky and T.S.E. Maibaum, editors, TAPSOFT\/CAAP, volume 493, pages 293\u2013319. Springer Verlag, 1991.","DOI":"10.1007\/3-540-53982-4_17"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"A. Di Pierro and H. Wiklicky. An operational semantics for Probabilistic Concurrent Constraint Programming. In P. Iyer, Y. Choo, and D. Schmidt, editors, ICCL'98 \u2014 International Conference on Computer Languages, pages 174-183. IEEE Computer Society and ACM SIGPLAN, IEEE Computer Society Press, May 1998.","DOI":"10.1109\/ICCL.1998.674168"},{"key":"41_CR5","volume-title":"volume 28 of Cambridge studies in advanced mathematics","author":"K. Goebel","year":"1990","unstructured":"K. Goebel and W.A. Kirk. Topics in Metric Fixed Point Theory, volume 28 of Cambridge studies in advanced mathematics. Cambridge University Press, Cambridge, 1990."},{"key":"41_CR6","volume-title":"Introduction to Probability","author":"C. M. Grinstead","year":"1997","unstructured":"C. M. Grinstead and J. L. Snell. Introduction to Probability. American Mathematical Society, Providence, Rhode Island, second revised edition, 1997.","edition":"second revised"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"V. Gupta, R. Jagadeesan, and V. A. Saraswat. Probabilistic concurrent constraint programming. In Proceedings of CONCUR 97. Springer Verlag, 1997.","DOI":"10.1007\/3-540-63141-0_17"},{"key":"41_CR8","volume-title":"PhD thesis","author":"C. Jones","year":"1993","unstructured":"Claire Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edingburgh, 1993."},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D. Kozen","year":"1981","unstructured":"Dexter Kozen. Semantics for probabilistic programs. Journal of Computer and System Sciences, 22:328\u2013350, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR10","unstructured":"C. Morgan, A. McIver, K. Seidel, and J.W. Sanders. Probabilistic predicate transformers. Technical Report PRG-TR-4-95, Programming Research Group, Oxford University Computing Laboratory, 1995."},{"key":"41_CR11","unstructured":"S. O. Nystr\u00f6m and B. Jonsson. Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. In D. Miller, editor, Proc. of the 1993 International Logic Programming Symposium, Series on Logic Programming, pages 335\u2013352. The MIT Press, 1993."},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90003-1","volume":"12","author":"N. Saheb-Djahromi","year":"1980","unstructured":"N. Saheb-Djahromi. CPO's of measures for nondeterminism. Theoretical Computer Science, 12:19\u201337, 1980.","journal-title":"Theoretical Computer Science"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"V. A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Proceedings of POPL, pages 333\u2013353. ACM, 1991.","DOI":"10.1145\/99583.99627"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:44:26Z","timestamp":1555771466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0055794","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}