{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:54:54Z","timestamp":1794336894077,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645702","type":"print"},{"value":"9783540693536","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028019","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:02:06Z","timestamp":1132624926000},"page":"255-274","source":"Crossref","is-referenced-by-count":6,"title":["A duality theory for quantitative semantics"],"prefix":"10.1007","author":[{"given":"Reinhold","family":"Heckmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Huth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1\u2013168. Clarendon Press, 1994.","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. ACompendium of Continuous Lattices. Springer Verlag, 1980.","DOI":"10.1007\/978-3-642-67678-9"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"P. R. Halmos. Measure Theory. D. van Norstrand Company, 1950.","DOI":"10.1007\/978-1-4684-9440-2"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(93)90182-S","volume":"111","author":"R. Heckmann","year":"1993","unstructured":"R. Heckmann. Power domains and second order predicates. Theoretical Computer Science, 111:59\u201388, 1993.","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"M. Huth and M. Kwiatkowska. Quantitative Analysis and Model Checking. Annual IEEE Symposium on Logic in Computer Science, pages 111\u2013122. IEEE Computer Society Press, June 1997.","DOI":"10.1109\/LICS.1997.614940"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Logic in Computer Science, pages 186\u2013195. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39173"},{"key":"16_CR7","unstructured":"C. Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edinburgh, 1990. Also published as Technical Report No. CST-63-90."},{"key":"16_CR8","unstructured":"C. Morgan, A. McIver, K. Seidel, and J.W. Sanders. Probabilistic Predicate Transformers. Technical Report PRG-TR-4-95, Oxford University Computing Laboratory, 1995."},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C. Morgan","year":"1996","unstructured":"C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325\u2013353, May 1996.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR10","unstructured":"C. Morgan and A. McIver. An expectation-transformer model for probabilistic temporal logic. Technical report, Computing Laboratory, Oxford University, April 1997. Draft. Personal Communication."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1090\/S0002-9939-1952-0052392-3","volume":"3","author":"G. N. Raney","year":"1952","unstructured":"G. N. Raney. Completely distributive complete lattices. Proc. AMS, 3:667\u2013680, 1952.","journal-title":"Proc. AMS"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1090\/S0002-9947-1960-0120171-3","volume":"97","author":"G. N. Raney","year":"1960","unstructured":"G. N. Raney. Tight Galois connections and complete distributivity. Trans. AMS, 97:418\u2013426, 1960.","journal-title":"Trans. AMS"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"M. B. Smyth. Powerdomains and predicate transformers: a topological view. In J. Diaz, editor, Automata, Languages and Programming, volume 154 of Lecture Notes in Computer Science, pages 662-675. Springer Verlag, 1983.","DOI":"10.1007\/BFb0036946"},{"key":"16_CR14","unstructured":"Wim Vervaat. Random upper semicontinuous functions and extremal processes. In W. Vervaat and H. Holwerda, editors, Probability and Lattices, pages 1\u201356. CWI Tracts, 1991."},{"key":"16_CR15","unstructured":"S. J. Vickers. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T15:03:51Z","timestamp":1736089431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645702","9783540693536"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0028019","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0028003","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}