{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T22:36:21Z","timestamp":1763764581554},"publisher-location":"London","reference-count":16,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540198222"},{"type":"electronic","value":"9781447132172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-1-4471-3217-2_6","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T17:40:09Z","timestamp":1326735609000},"page":"86-100","source":"Crossref","is-referenced-by-count":2,"title":["Exception Handling in Process Algebra"],"prefix":"10.1007","author":[{"given":"F. S.","family":"de Boer","sequence":"first","affiliation":[]},{"given":"J.","family":"Coenen","sequence":"additional","affiliation":[]},{"given":"R.","family":"Gerth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Number 14 in CSLI Lecture Notes","author":"P Aczel","year":"1988","unstructured":"P. Aczel. Non-well-founded sets. Number 14 in CSLI Lecture Notes. 1988."},{"key":"6_CR2","volume-title":"Springer-Verlag","author":"American National Standards Institute","year":"1983","unstructured":"American National Standards Institute, Inc. The Programming Language Ada Reference Manual. LNCS 155, Springer-Verlag 1983."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"JA Bergstra","year":"1984","unstructured":"J.A. Bergstra & J.W. Klop. Process Algebra for Synchronous Communication. Information and Control 60: 109\u2013137, 1984.","journal-title":"Information and Control"},{"key":"6_CR4","volume-title":"Cambridge Tracts in Theoretical Computer Science","author":"JCM Baeten","year":"1990","unstructured":"J.C.M. Baeten & W.P. Wetland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, Vol 18, 1990."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TSE.1985.231534","volume":"11","author":"F Cristian","year":"1985","unstructured":"F. Cristian. A Rigorous Approach to Fault-Tolerant Programming. IEEE Transactions on Software Engineering 11: 23\u201331, 1985.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6423(83)90010-2","volume":"3","author":"TI Dix","year":"1983","unstructured":"T.I. Dix. Exceptions and Interrupts in CSP. Science of Computer Programming 3: 189\u2013204, 1983.","journal-title":"Science of Computer Programming"},{"key":"6_CR7","first-page":"332","volume":"443","author":"JF Groote","year":"1990","unstructured":"J.F. Groote. Transition System Specifications with Negative Premises. Proc. CONCUR \u201880, LNCS 443 pp. 332\u2013341, 1990.","journal-title":"Proc. CONCUR \u201880, LNCS"},{"key":"6_CR8","volume-title":"University of Amsterdam","author":"JF Groote","year":"1991","unstructured":"J.F. Groote Process Algebra and Structured Operational Semantics. PhD Thesis Centre for Mathematics and Computer Science, University of Amsterdam, 1991."},{"key":"6_CR9","volume-title":"Prentice-Hall","author":"CAR Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall 1985."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01786251","volume":"2","author":"Jifeng","year":"1987","unstructured":"He Jifeng & C.A.R. Hoare. Algebraic Specification and Proof of a Distributed Recovery Algorithm. Distributed Computing 2: 1\u201312, 1987.","journal-title":"Distributed Computing"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF02983373","volume":"28","author":"K Lodaya","year":"1990","unstructured":"K. Lodaya & R.K. Shyamasundar. Proof Theory for Exception Handling in a Tasking Environment. Acta Informatics 28: 7\u201342, 1990.","journal-title":"Acta Informatics"},{"key":"6_CR12","volume-title":"Prentice-Hall","author":"R Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall 1989."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02259751","volume":"5","author":"J Peleska","year":"1991","unstructured":"J. Peleska. Design and Verification of Fault Tolerant Systems with CSP. Distributed Computing 5: 95\u2013106, 1991.","journal-title":"Distributed Computing"},{"key":"6_CR14","volume-title":"University of Edinburgh","author":"KVS Prasad","year":"1984","unstructured":"K.V.S. Prasad. Specification and Proof of a Simple Fault Tolerant System in CCS. Internal Report CSR-1178\u201384, Department of Computer Science, University of Edinburgh, 1984."},{"key":"6_CR15","volume-title":"PhD Thesis University of Edinburgh","author":"KVS Prasad","year":"1987","unstructured":"K.V.S. Prasad. Combinators and Bisimulation Proofs for Restartable Systems. PhD Thesis University of Edinburgh, 1987."},{"key":"6_CR16","unstructured":"J.J.M.M. Rutten. Processes as terms: non-well-founded models for bisimulation. Technical report CWI CS-R9211, also to appear in Mathematical Structures in Computer Science."}],"container-title":["Workshops in Computing","NAPAW 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3217-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:51:55Z","timestamp":1556149915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3217-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540198222","9781447132172"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3217-2_6","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1993]]}}}