{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:37Z","timestamp":1725456157022},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600176"},{"type":"electronic","value":"9783540494041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022270","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:12:29Z","timestamp":1132639949000},"page":"382-396","source":"Crossref","is-referenced-by-count":4,"title":["Powerdomains, powerstructures and fairness"],"prefix":"10.1007","author":[{"given":"Yiannis N.","family":"Moschovakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glen T.","family":"Whitney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science 74","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-09526-8_8","volume-title":"Proceedings of MFCS","author":"M. Hennessy","year":"1979","unstructured":"M. Hennessy and G. D. Plotkin, \u201cFull abstraction for a simple parallel programming language,\u201d Proceedings of MFCS, Lecture Notes in Computer Science 74, ed. J. Becvar, Berlin: Springer-Verlag (1979) 108\u2013120."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Y. N. Moschovakis, \u201cA game-theoretic modeling of concurrency,\u201d Extended abstract, Proceedings of the fourth annual symposium on Logic in Computer Science, IEEE Computer Society Press (1989) 154\u2013163.","DOI":"10.1109\/LICS.1989.39170"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0890-5401(91)90054-6","volume":"93","author":"Y. N. Moschovakis","year":"1991","unstructured":"Y. N. Moschovakis, \u201cA model of concurrency with fair merge and full recursion,\u201d Information and Computation 93 (1991) 114\u2013171.","journal-title":"Information and Computation"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Y. N. Moschovakis, \u201cComputable, concurrent processes,\u201d Theoretical Computer Science (to appear).","DOI":"10.1016\/0304-3975(94)00117-2"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science 104","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/3-540-10007-5_47","volume-title":"Proc. Copenhagen Winter School","author":"D. Park","year":"1980","unstructured":"D. Park, \u201cOn the semantics of fair parallelism,\u201d Proc. Copenhagen Winter School, Lecture Notes in Computer Science 104, Berlin: Springer-Verlag (1980) 504\u2013526."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. D. Plotkin","year":"1976","unstructured":"G. D. Plotkin, \u201cA powerdomain construction,\u201d SIAM J. of Comput. 5 (1976) 452\u2013487.","journal-title":"SIAM J. of Comput."},{"key":"28_CR7","first-page":"418","volume-title":"Lecture Notes in Computer Science 140","author":"G. D. Plotkin","year":"1982","unstructured":"G. D. Plotkin, \u201cA powerdomain for countable non-determinism,\u201d Automata, Languages, and Programming 9th Colloquium, Lecture Notes in Computer Science 140, eds. M. Nielsen and E. Schmidt, Berlin: Springer-Verlag (1982) 418\u2013428."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. B. Smyth","year":"1978","unstructured":"M. B. Smyth, \u201cPower Domains,\u201d J. Comput. System Sci. 16 (1978) 23\u201336.","journal-title":"J. Comput. System Sci."},{"key":"28_CR9","volume-title":"Ph.D. Thesis","author":"G. T. Whitney","year":"1994","unstructured":"G. T. Whitney, \u201cRecursion Structures for Non-Determinism and Concurrency, \u201d Ph.D. Thesis, University of California, Los Angeles (1994)."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T21:13:14Z","timestamp":1554585194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600176","9783540494041"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0022270","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}