{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:21Z","timestamp":1763467701112,"version":"build-2065373602"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80465-7","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"34-54","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["Domain Equations for Probabilistic Processes (Extended Abstract)"],"prefix":"10.1016","volume":"7","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Marta","family":"Kwiatkowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80465-7_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","article-title":"A Domain Equation for Bisimulation","volume":"Vol. 92","author":"Abramsky","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB2","first-page":"1","article-title":"Domain Theory, In","volume":"Vol. 3","author":"Abramsky","year":"1994"},{"issue":"No. 3","key":"10.1016\/S1571-0661(05)80465-7_BIB3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(89)90027-5","article-title":"Solving Recursive Domain Equations in a Category of Complete Metric Spaces","volume":"Vol. 39","author":"America","year":"1989","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0304-3975(96)00107-7","article-title":"Trees and Semantics","volume":"Vol. 179","author":"Baier","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB5","unstructured":"C. Baier, M.Z. Kwiatkowska: Domain Equations for Probabilistic Processes, Technical Report CSR-97-7, University of Birmingham, 1997. Submitted for publication."},{"key":"10.1016\/S1571-0661(05)80465-7_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(94)00046-8","article-title":"Denotational Semantics in the CPO and Metric Approach","volume":"Vol. 135","author":"Baier","year":"1994","journal-title":"Theoretical Computer Science"},{"issue":"No. 3","key":"10.1016\/S1571-0661(05)80465-7_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-1997-29302","article-title":"How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages","volume":"Vol. 29","author":"Baier","year":"1997","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB8","unstructured":"J.W. de Bakker, J.J.Ch. Meyer: Metric Semantics for Concurrency, Report CS-R8803, Centre for Mathematics and Computer Science, Amsterdam, 1988."},{"issue":"No. 1\/2","key":"10.1016\/S1571-0661(05)80465-7_BIB9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the Denotational Semantics of Concurrency","volume":"Vol.54","author":"de Bakker","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB10","doi-asserted-by":"crossref","unstructured":"I. Christoff: Testing Equivalences and Fully Abstract Models for Probabilistic Processes, Proc. CONCUR'90, LNCS 458, pp 126-140, 1990.","DOI":"10.1007\/BFb0039056"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB11","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, S. Smolka, A. Zwarico: Testing Preorders for Probabilistic Processes, Proc. ICALP'92, LNCS 623, pp 708-719, 1992.","DOI":"10.1007\/3-540-55719-9_116"},{"issue":"No. 4","key":"10.1016\/S1571-0661(05)80465-7_BIB12","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1145\/210332.210339","article-title":"The Complexity of Probabilistic Verification","volume":"Vol. 42","author":"Courcoubetis","year":"1995","journal-title":"Journal of the ACM"},{"volume":"Vol. 6","year":"1989","author":"Engelking","key":"10.1016\/S1571-0661(05)80465-7_BIB13"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB14","unstructured":"A. Giacalone, C. Jou, S. Smolka: Algebraic Reasoning for Probabilistic Concurrent Systems, Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, 1990."},{"year":"1980","series-title":"A Compendium of Continuous Lattices","author":"Gierz","key":"10.1016\/S1571-0661(05)80465-7_BIB15"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB16","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek, S. Smolka, B. Steffen, C. Tofts: Reactive, Generative, and Stratified Models for Probabilistic Processes, Proc. LICS'90, pp 130-141, 1990.","DOI":"10.1109\/LICS.1990.113740"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB17","first-page":"102","article-title":"Connection Between Two Theories of Concurrency:","volume":"Vol. 57","author":"Golson","year":"1983","journal-title":"Metric Spaces and Synchronisation Trees, Information and Control"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB18","doi-asserted-by":"crossref","unstructured":"H. Hansson, B. Jonsson: A Calculus for Communicating Systems with Time and Probabilities, in Proc. 11th IEEE Symposium on Real Time Systems, 1990.","DOI":"10.1109\/REAL.1990.128759"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB19","unstructured":"R. Heckmann: Spaces of Valuations, Technical Report A 09\/95, FB 14 Informatik, Universit\u00e4t des Saarlandes, 1995."},{"year":"1985","series-title":"Communicating Sequential Processes, Prentice Hall","author":"Hoare","key":"10.1016\/S1571-0661(05)80465-7_BIB20"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB21","unstructured":"C. Jones: Probabilistic Non-Determinism, PhD Thesis, University of Edinburgh, 1990."},{"key":"10.1016\/S1571-0661(05)80465-7_BIB22","doi-asserted-by":"crossref","unstructured":"C. Jones, G.D. Plotkin: A Probabilistic Powerdomain on Evaluations, Proc. LICS'89, pp 186-195, 1989.","DOI":"10.1109\/LICS.1989.39173"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB23","doi-asserted-by":"crossref","unstructured":"B. Jonsson, K.G. Larsen: Specification and Refinement of Probabilistic Processes, Proc. LICS'91, pp 266-277, 1991.","DOI":"10.1109\/LICS.1991.151651"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB24","doi-asserted-by":"crossref","unstructured":"B. Jonsson, W. Yi: Compositional Testing Preorders for Probabilistic Processes, Proc. LICS'95, pp 431-443, 1995.","DOI":"10.1109\/LICS.1995.523277"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB25","doi-asserted-by":"crossref","unstructured":"C.-C. Jou, S. Smolka: Equivalences, congruences and complete axiomatizations for probabilistic processes, Proc. CONCUR'90, LNCS 458, pp 367-383, 1990.","DOI":"10.1007\/BFb0039071"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB26","doi-asserted-by":"crossref","first-page":"114","DOI":"10.4064\/fm-43-1-114-138","article-title":"Sur une m\u00e9thode de m\u00e9trisation compl\u00e8te des certains espaces d'ensembles compacts","volume":"43","author":"Kuratowski","year":"1956","journal-title":"Fundamentae Mathematicae"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB27","doi-asserted-by":"crossref","unstructured":"M.Z. Kwiatkowska, G. Norman: Probabilistic Metric Semantics for a Simple Language with Recursion, Proc. MFCS'96, LNCS 1113, pp 419-430, 1996.","DOI":"10.1007\/3-540-61550-4_167"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB28","first-page":"456","volume":"Vol. 94","author":"Larsen","year":"1991","journal-title":"Bisimulation through Probabilistic Testing, Information and Computation"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB29","unstructured":"D. Lehmann: Categories for Mathematical Semantics, Proc. FOCS'76, IEEE Press, 1976."},{"key":"10.1016\/S1571-0661(05)80465-7_BIB30","unstructured":"G. Lowe: Probabilities and Priorities in Timed CSP, D. Phil thesis, Oxford, 1991."},{"key":"10.1016\/S1571-0661(05)80465-7_BIB31","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(88)90224-4","article-title":"On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces","volume":"Vol. 29","author":"Majster-Cederbaum","year":"1988","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(89)90181-6","article-title":"The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces","volume":"Vol. 33","author":"Majster-Cederbaum","year":"1988","journal-title":"Information Processing Letters"},{"issue":"No. 2","key":"10.1016\/S1571-0661(05)80465-7_BIB33","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0890-5401(91)90005-M","article-title":"Towards a Foundation for Semantics in Complete Metric Spaces","volume":"Vol. 90","author":"Majster-Cederbaum","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB34","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for Synchrony and Asynchrony","volume":"Vol. 25","author":"Milner","year":"1983","journal-title":"Theoretical Computer Science"},{"year":"1989","series-title":"Communication and Concurrency, Prentice Hall","author":"Milner","key":"10.1016\/S1571-0661(05)80465-7_BIB35"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB36","unstructured":"G. Norman: Metric Semantics for Reactive Probabilistic Processes, PhD Thesis, University of Birmingham, forthcoming."},{"key":"10.1016\/S1571-0661(05)80465-7_BIB37","unstructured":"D. Turi, G. Plotkin: Towards a Mathematical Operational Semantics, Proc. LICS'97, IEEE Computer Society Press, 1997."},{"key":"10.1016\/S1571-0661(05)80465-7_BIB38","doi-asserted-by":"crossref","unstructured":"J.J.M.M. Rutten, D. Turi: On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces and Partial Orders, Proc. REX'92, LNCS 666, pp 477-530, 1993.","DOI":"10.1007\/3-540-56596-5_45"},{"year":"1977","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","key":"10.1016\/S1571-0661(05)80465-7_BIB39"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB40","doi-asserted-by":"crossref","unstructured":"R. Segala, N. Lynch: Probabilistic Simulations for Probabilitsic Processes, Proc. CONCUR'94, LNCS 836, pp 481-496, 1994.","DOI":"10.1007\/978-3-540-48654-1_35"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB41","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The Category-Theoretic Solution of Recursive Equations","volume":"Vol. 11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput"},{"issue":"No. 5","key":"10.1016\/S1571-0661(05)80465-7_BIB42","doi-asserted-by":"crossref","DOI":"10.1007\/BF01211867","article-title":"Processes with Probabilities","volume":"Vol. 6","author":"Tofts","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB43","doi-asserted-by":"crossref","unstructured":"M. Vardi: Automatic Verification of Probabilistic Concurrent Finite-State Programs, Proc. 26th Symp. on Foundations of Computer Science, pp 327-338, 1985.","DOI":"10.1109\/SFCS.1985.12"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB44","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(84)90112-9","volume":"Vol. 34","author":"Winskel","year":"1984","journal-title":"Synchronisation Trees, Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB45","doi-asserted-by":"crossref","unstructured":"S. Yuen, R. Cleaveland, Z. Dayar, S. Smolka: Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes, Proc. CONCUR'94, LNCS 836, pp 497-512, 1994.","DOI":"10.1007\/978-3-540-48654-1_36"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB46","doi-asserted-by":"crossref","unstructured":"W. Yi: Algebraic Reasoning for Real-Time Probabilistic Processes with Uncertain Information, Proc. FTRTFT'94, LNCS 863, pp 680-693, 1994.","DOI":"10.1007\/3-540-58468-4_190"},{"key":"10.1016\/S1571-0661(05)80465-7_BIB47","doi-asserted-by":"crossref","unstructured":"W. Yi, K. Larsen: Testing Probabilistic and Nondeterministic Processes, Proc. Protocol, Specification, Testing, Verification XII, pp 47-61, 1992.","DOI":"10.1016\/B978-0-444-89874-6.50010-6"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804657?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804657?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:48Z","timestamp":1761610008000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":47,"alternative-id":["S1571066105804657"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80465-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Domain Equations for Probabilistic Processes (Extended Abstract)","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80465-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}