{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:15Z","timestamp":1725663255503},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540168164"},{"type":"electronic","value":"9783540448617"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16816-8_31","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:05:06Z","timestamp":1330178706000},"page":"162-183","source":"Crossref","is-referenced-by-count":4,"title":["Free constructions of powerdomains"],"prefix":"10.1007","author":[{"given":"Michael G.","family":"Main","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Experiments, powerdomains and fully abstract models for applicative multiprogramming, in: Foundations of Computation Theory, LNCS 158, (Springer-Verlag, 1983), 1\u201313.","DOI":"10.1007\/3-540-12689-9_89"},{"key":"10_CR2","unstructured":"E.W. Dijkstra. A Discipline of Programming, (Prentice-Hall, 1976)."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"M.C.B. Hennessy and G.D. Plotkin. Full abstraction for a simple parallel programming language, in: Mathematical Foundations of Computer Science 79, LNCS 74, (Springer-Verlag, 1979), 108\u2013120.","DOI":"10.1007\/3-540-09526-8_8"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D. Kozen","year":"1981","unstructured":"D. Kozen. Semantics of probabilistic programs, Journal of Computer and System Sciences 22 (1981), 328\u2013350.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"D. Lehmann, A. Pnueli and J. Stavi. Impartiality, justice and fairness: the ethics of concurrent computation, in: Automata, Languages and Programming, 8th Colloquium, LNCS 115, (Springer-Verlag, 1981), 264\u2013277.","DOI":"10.1007\/3-540-10843-2_22"},{"key":"10_CR6","series-title":"Technical Report Number","volume-title":"Semiring Module Powerdomains","author":"M.G. Main","year":"1984","unstructured":"M.G. Main, Semiring Module Powerdomains, Technical Report Number CU-CS-286-84, Department of Computer Science, University of Colorado at Boulder, Boulder, CO 80309 (1984)."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"R. de Nicola and M.C.B. Hennessy. Testing equivalences for processes, in: Automata, Languages and Programming, 10th Colloquium, LNCS 154, (Springer-Verlag, 1983), 548\u2013560.","DOI":"10.1007\/BFb0036936"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"D. Park. On the semantics of fair parallelism, in: Abstract Software Specifications LNCS 86 (Springer-Verlag, 1980), 504\u2013526.","DOI":"10.1007\/3-540-10007-5_47"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G.D. Plotkin","year":"1976","unstructured":"G.D. Plotkin. A powerdomain construction, SIAM J. Computing 5 (1976), 452\u2013487.","journal-title":"SIAM J. Computing"},{"key":"10_CR10","unstructured":"G.D. Plotkin. Computer Science Postgraduate Course Notes, University of Edinburgh, 1980\u201381."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"A. Pnueli. On the extremely fair treatment of probabilistic algorithms, in: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, (1983), 278\u2013290.","DOI":"10.1145\/800061.808757"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"A. Poigne. Using least fixed points to characterize formal computations of nondeterminate equations, in: Formalizations of Programming Concepts (J. Diaz and I. Ramos, Eds.), LNCS 107, (Springer-Verlag, 1981), 447\u2013459.","DOI":"10.1007\/3-540-10699-5_118"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"A. Poigne. On effective computations of nondeterministic schemes, in: 5th International Symposium on Programming, LNCS 137, (Springer-Verlag, 1982), 323\u2013336.","DOI":"10.1007\/3-540-11494-7_21"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. Smyth","year":"1978","unstructured":"M. Smyth. Powerdomains, Journal of Computer and System Sciences 16 (1978), 23\u201336.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"G. Winskel. Synchronisation trees, in: Automata, Languages and Programming, 10th Colloquium, LNCS 154, (Springer-Verlag, 1983), 696\u2013711.","DOI":"10.1007\/BFb0036949"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16816-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:12:03Z","timestamp":1605625923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16816-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540168164","9783540448617"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-16816-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}