{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:39:46Z","timestamp":1754487586875},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf02259751","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T19:06:08Z","timestamp":1132686368000},"page":"95-106","source":"Crossref","is-referenced-by-count":25,"title":["Design and verification of fault tolerant systems with CSP"],"prefix":"10.1007","volume":"5","author":[{"given":"Jan","family":"Peleska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02259751_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"9","author":"KR Apt","year":"1980","unstructured":"Apt KR, Francez N, De Roever WP: A proof system for communicating sequential processes. ACM Trans Program Lang Syst 9:359\u2013385 (1980)","journal-title":"ACM Trans Program Lang Syst"},{"key":"BF02259751_CR2","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/5956.6000","volume":"8","author":"KR Apt","year":"1986","unstructured":"Apt KR: Correctness proofs of distributed termination algorithms. ACM Trans Program Lang Syst 8:388\u2013405 (1986)","journal-title":"ACM Trans Program Lang Syst"},{"key":"BF02259751_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0020-0190(87)90001-9","volume":"26","author":"KR Apt","year":"1987","unstructured":"Apt KR, Boug\u00e9 L, Clermont P: Two normal form theorems for CSP programs. Inf Process Lett 26:165\u2013171 (1987)","journal-title":"Inf Process Lett"},{"key":"BF02259751_CR4","doi-asserted-by":"crossref","unstructured":"Carr\u00e9 B: Reliable programming in standard languages. In: Sennet C (ed) High-integrity software. Pitman, R.S.R.E. Malvern, pp 102\u2013121","DOI":"10.1007\/978-1-4684-5775-9_5"},{"key":"BF02259751_CR5","volume-title":"Structured analysis and system specification","author":"T Marco De","year":"1979","unstructured":"De Marco T: Structured analysis and system specification. Prentice-Hall, Englewood Cliffs, NJ, 1979"},{"key":"BF02259751_CR6","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR: Communicating sequential processes. Prentice-Hall, Englewood Cliffs, NJ, 1985."},{"key":"BF02259751_CR7","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare CAR: An axiomatic basis for computer programming. Commun ACM 12:576\u2013580 (1969)","journal-title":"Commun ACM"},{"key":"BF02259751_CR8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01784887","volume":"3","author":"P Jalote","year":"1989","unstructured":"Jalote P: Fault tolerant processes. Distrib Comput 3:187\u2013195 (1989)","journal-title":"Distrib Comput"},{"key":"BF02259751_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01786251","volume":"2","author":"H Jifeng","year":"1987","unstructured":"Jifeng H, Hoare CAR: Algebraic specification and proof of a distributed recovery algorithm. Distrib Comput 2:1\u201312 (1987)","journal-title":"Distrib Comput"},{"key":"BF02259751_CR10","volume-title":"Systematic software development using VDM","author":"CB Jones","year":"1986","unstructured":"Jones CB: Systematic software development using VDM. Prentice-Hall, Englewood Cliffs, NJ, 1986."},{"key":"BF02259751_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-96753-4","volume-title":"The foundations of program verification","author":"J Loeckx","year":"1987","unstructured":"Loeckx J, Sieber K: The foundations of program verification, 2nd edn. Wiley, Teubner, Stuttgart 1987","edition":"2nd edn."},{"key":"BF02259751_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01887197","volume":"1","author":"M Thomas","year":"1989","unstructured":"Thomas M: Development methods for trusted computer systems. Formal Aspects Comput 1:5\u201318 (1989)","journal-title":"Formal Aspects Comput"},{"key":"BF02259751_CR13","first-page":"64","volume":"3","author":"D Z\u00f6bel","year":"1988","unstructured":"Z\u00f6bel D: Normalform-Transformationen f\u00fcr CSP-Programme. Informatik Forsch Entwickl 3:64\u201376 (1988)","journal-title":"Informatik Forsch Entwickl"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02259751.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02259751\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02259751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:08:13Z","timestamp":1558004893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02259751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF02259751"],"URL":"https:\/\/doi.org\/10.1007\/bf02259751","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}