{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:04:08Z","timestamp":1743105848569,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319148052"},{"type":"electronic","value":"9783319148069"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14806-9_3","type":"book-chapter","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T04:22:35Z","timestamp":1420431755000},"page":"42-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Angelicism in the Theory of Reactive Processes"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Ana","family":"Cavalcanti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0167-6423(87)90011-6","volume":"9","author":"JM Morris","year":"1987","unstructured":"Morris, J.M.: A theoretical basis for stepwise refinement and the programming calculus. Sci. Comput. Program. 9, 287\u2013306 (1987)","journal-title":"Sci. Comput. Program."},{"key":"3_CR2","unstructured":"Morgan, C.: Programming from specifications. Prentice Hall (1994)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Back, R., Wright, J.: Refinement calculus: a systematic introduction. Graduate texts in computer science. Springer (1998)","DOI":"10.1007\/978-1-4612-1674-2_1"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/11921240_9","volume-title":"Theoretical Aspects of Computing - ICTAC 2006","author":"M Tyrrell","year":"2006","unstructured":"Tyrrell, M., Morris, J.M., Butterfield, A., Hughes, A.: A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds.) ICTAC 2006. LNCS, vol. 4281, pp. 123\u2013137. Springer, Heidelberg (2006)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Roscoe, A.W.: Understanding concurrent systems. Springer (2010)","DOI":"10.1007\/978-1-84882-258-0"},{"key":"3_CR6","unstructured":"Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice Hall International Series in Computer Science (1998)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/s00165-006-0001-8","volume":"18","author":"A Cavalcanti","year":"2006","unstructured":"Cavalcanti, A., Woodcock, J., Dunne, S.: Angelic nondeterminism in the unifying theories of programming. Formal Aspects of Computing 18, 288\u2013307 (2006)","journal-title":"Formal Aspects of Computing"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-24615-2_12","volume-title":"Theory and Applications of Relational Structures as Knowledge Instruments","author":"I Rewitzky","year":"2003","unstructured":"Rewitzky, I.: Binary Multirelations. In: de Swart, H., Or\u0142owska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 256\u2013271. Springer, Heidelberg (2003)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Cavalcanti, A.: Designs with Angelic Nondeterminism. In: 2013 International Symposium on Theoretical Aspects of Software Engineering (TASE), pp. 71\u201378 (2013)","DOI":"10.1109\/TASE.2013.18"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/11889229_6","volume-title":"Refinement Techniques in Software Engineering","author":"A Cavalcanti","year":"2006","unstructured":"Cavalcanti, A., Woodcock, J.: A Tutorial Introduction to CSP in Unifying Theories of Programming. In: Cavalcanti, A., Sampaio, A., Woodcock, J. (eds.) PSSE 2004. LNCS, vol. 3167, pp. 220\u2013268. Springer, Heidelberg (2006)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24756-2_4","volume-title":"Integrated Formal Methods","author":"J Woodcock","year":"2004","unstructured":"Woodcock, J., Cavalcanti, A.: A Tutorial Introduction to Designs in Unifying Theories of Programming. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol. 2999, pp. 40\u201366. Springer, Heidelberg (2004)"},{"key":"3_CR12","unstructured":"Ribeiro, P.: Reactive angelic processes. Technical report, University of York (February 2014). http:\/\/www-users.cs.york.ac.uk\/pfr\/reports\/rac.pdf"},{"key":"3_CR13","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall (1998)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-27764-4_15","volume-title":"Mathematics of Program Construction","author":"JM Morris","year":"2004","unstructured":"Morris, J.M.: Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 274\u2013288. Springer, Heidelberg (2004)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.scico.2006.01.008","volume":"65","author":"JM Morris","year":"2007","unstructured":"Morris, J.M., Tyrrell, M.: Terms with unbounded demonic and angelic nondeterminacy. Science of Computer Programming 65(2), 159\u2013172 (2007)","journal-title":"Science of Computer Programming"},{"issue":"22\u201324","key":"3_CR16","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1016\/j.tcs.2010.03.016","volume":"411","author":"WH Hesselink","year":"2010","unstructured":"Hesselink, W.H.: Alternating states for dual nondeterminism in imperative programming. Theoretical Computer Science 411(22\u201324), 2317\u20132330 (2010)","journal-title":"Theoretical Computer Science"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Guttmann, W.: Algebras for correctness of sequential computations. Science of Computer Programming 85, Part B(0), 224\u2013240 (2014). Special Issue on Mathematics of Program Construction 2012","DOI":"10.1016\/j.scico.2013.08.008"}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14806-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T12:26:47Z","timestamp":1675254407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-14806-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319148052","9783319148069"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14806-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"6 January 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}