{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:27Z","timestamp":1725456387432},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002780","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"538-545","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Testing semantics for unbounded nondeterminism"],"prefix":"10.1007","author":[{"given":"Luis Fdo.","family":"Llana D\u00edaz","sequence":"first","affiliation":[]},{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01898399","volume":"3","author":"G. Barret","year":"1991","unstructured":"G. Barret. The fixed point theory of unbounded non-determinism. Formal Aspects of Computing, 3:110\u2013128, 1991.","journal-title":"Formal Aspects of Computing"},{"issue":"4","key":"68_CR2","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy. Acceptance trees. Journal of the ACM, 32(4):896\u2013928, 1985.","journal-title":"Journal of the ACM"},{"key":"68_CR3","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"M.W. Mislove. Denotational models for unbounded nondeterminism. In Proceedings of 11th Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science 1, 1995.","DOI":"10.1016\/S1571-0661(04)00023-4"},{"key":"68_CR6","unstructured":"A. W. Roscoe and G. Barret. Unbounded non-determinism in CSP. In Mathematical Foundations of Programming Semantics, LCNS 442, 1989."},{"issue":"2","key":"68_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1093\/logcom\/3.2.131","volume":"3","author":"A.W. Roscoe","year":"1993","unstructured":"A.W. Roscoe. Unbounded non-determinism in CSP. Journal of Logic and Computation, 3(2):131\u2013172, 1993.","journal-title":"Journal of Logic and Computation"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:58:36Z","timestamp":1683302316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0002780","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}