{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T10:48:55Z","timestamp":1672915735031},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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,12]]},"DOI":"10.1007\/bf01784721","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T22:05:39Z","timestamp":1119218739000},"page":"209-230","source":"Crossref","is-referenced-by-count":29,"title":["Deadlock analysis in networks of communicating processes"],"prefix":"10.1007","volume":"4","author":[{"given":"S. D.","family":"Brookes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01784721_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Logics of programs, Proceedings","author":"KR Apt","year":"1983","unstructured":"Apt KR: A static analysis of CSP programs. In: Clarke EM, Kozen D (ed) Logics of programs, Proceedings. Lect Notes Comput Sci, vol 164. Springer, Berlin Heidelberg New York 1983, pp 1\u201317"},{"key":"BF01784721_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82453-1","volume-title":"Logics and models of concurrent systems. NATO ASI Ser, Ser F","author":"KR Apt","year":"1985","unstructured":"Apt KR: Logics and models of concurrent systems. NATO ASI Ser, Ser F, vol 13. Springer, Berlin Heidelberg New York 1985"},{"issue":"3","key":"BF01784721_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"KR Apt","year":"1980","unstructured":"Apt KR, Francez N, de Roever WP: A proof system for communicating sequential processes. ACM TOPLAS 2(3): 359\u2013385 (1980)","journal-title":"ACM TOPLAS"},{"key":"BF01784721_CR4","doi-asserted-by":"crossref","unstructured":"Brookes SD, Hoare CAR, Roscoe AW: A theory of communicating sequential process. JACM (July 1984)","DOI":"10.1145\/828.833"},{"key":"BF01784721_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-15670-4_14","volume-title":"Proc. NSF-SERC Seminar on Concurrency","author":"SD Brookes","year":"1985","unstructured":"Brookes SD, Roscoe AW: An improved failures model for communicating processes. Proc. NSF-SERC Seminar on Concurrency. Lect Notes Comput Sci, vol 197. Springer, Berlin Heidelberg New York 1985, pp 281\u2013300"},{"key":"BF01784721_CR6","series-title":"NATO ASI Ser, Ser F","first-page":"305","volume-title":"Deadlock analysis in networks of processes","author":"SD Brookes","year":"1985","unstructured":"Brookes SD, Roscoe AW: Deadlock analysis in networks of processes. NATO ASI Ser, Ser F, vol 13. Springer, Berlin Heidelberg New York 1985, pp 305\u2013323"},{"issue":"1","key":"BF01784721_CR7","first-page":"13","volume":"81","author":"MC Browne","year":"1989","unstructured":"Browne MC, Clarke EM, Grumberg O: Reasoning about networks with many identical processes. Inf: Comput 81(1): 13\u201331 (1989)","journal-title":"Inf: Comput"},{"key":"BF01784721_CR8","unstructured":"Burch JR, Clarke EM, Dill DL, Hwang LJ: Symbolic model checking: 1020 states and beyond. Proc. 5th IEEE Annual Symposium on Logic in Computer Science. IEEE Press (June 1990)"},{"issue":"4","key":"BF01784721_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(79)90065-6","volume":"9","author":"KM Chandy","year":"1979","unstructured":"Chandy KM, Misra J: Deadlock absence proofs for networks of communicating processes. Inf Process Lett 9(4): 185\u2013189 (1979)","journal-title":"Inf Process Lett"},{"key":"BF01784721_CR10","unstructured":"Dathi N: Deadlock and deadlock-freedom. D. Phil. thesis, Oxford University (1989)"},{"key":"BF01784721_CR11","first-page":"334","volume-title":"Selected writings on computing","author":"EW Dijkstra","year":"1982","unstructured":"Dijkstra EW, Scholten CS: A class of simple communication patterns, EwD643. In: Dijkstra EW (ed) Selected writings on computing. Springer, Berlin Heidelberg New York 1982, pp 334\u2013337"},{"key":"BF01784721_CR12","first-page":"157","volume-title":"Mathematical logic and programming languages","author":"EW Dijkstra","year":"1985","unstructured":"Dijkstra EW: Invariance and non-determinacy. In: Hoare CAR, Shepherdson JC (eds) Mathematical logic and programming languages. Prentice-Hall, Englewood Cliffs, NJ, 1985, pp 157\u2013165"},{"issue":"8","key":"BF01784721_CR13","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"EW Dijkstra","year":"1975","unstructured":"Dijkstra EW: Guarded commands, non-determinacy, and formal derivation of programs. CACM 18(8): 453\u2013457 (1975)","journal-title":"CACM"},{"key":"BF01784721_CR14","unstructured":"German S, Sistla AP: Reasoning about systems with many processes. In: Proc 2nd IEEE Symp on Logic in Computer Science, Ithaca, New York 1987, pp 138\u2013152"},{"issue":"8","key":"BF01784721_CR15","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"Hoare CAR: Communicating sequential processes. CACM 21(8): 666\u2013677 (1978)","journal-title":"CACM"},{"key":"BF01784721_CR16","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR: Communicating sequential processes. Prentice-Hall, Englewood Cliffs, NJ, 1985"},{"issue":"3","key":"BF01784721_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/356603.356607","volume":"4","author":"RC Holt","year":"1972","unstructured":"Holt RC: Some deadlock properties of computer systems. ACM Comput Surv 4(3): 179\u2013196 (1972)","journal-title":"ACM Comput Surv"},{"key":"BF01784721_CR18","volume-title":"The occam programming manual","author":"INMOS Ltd.","year":"1984","unstructured":"INMOS Ltd.: The occam programming manual. Prentice-Hall, Englewood Cliffs, NJ, 1984"},{"key":"BF01784721_CR19","doi-asserted-by":"crossref","unstructured":"Kurshan RP, McMillan K: A structural induction theorem for processes. Proc. 8th ACM Symp on Principles of Distributed Computing, Edmonton (1989)","DOI":"10.1145\/72981.72998"},{"issue":"2","key":"BF01784721_CR20","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/322123.322134","volume":"26","author":"G Milne","year":"1979","unstructured":"Milne G, Milner R: Concurrent processes and their syntax. JACM 26(2): 302\u2013321 (1979)","journal-title":"JACM"},{"key":"BF01784721_CR21","volume-title":"Operating system concepts","author":"J Peterson","year":"1983","unstructured":"Peterson J, Silberschatz A: Operating system concepts. Addison Wesley, Reading, Mass, 1983"},{"key":"BF01784721_CR22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF00264434","volume":"18","author":"W Reisig","year":"1982","unstructured":"Reisig W: Deterministic buffer synchronization of sequential processes. Acta Inf 18: 117\u2013134 (1982)","journal-title":"Acta Inf"},{"key":"BF01784721_CR23","unstructured":"Roscoe AW: A mathematical theory of communicating processes. D. Phil. thesis, Oxford University (1982)"},{"key":"BF01784721_CR24","unstructured":"Roscoe AW: Routing messages through networks: an exercise in deadlock avoidance. Proceedings of OUGTM7, Grenoble 1987, published by IMAG."},{"issue":"3","key":"BF01784721_CR25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0890-5401(87)90004-6","volume":"75","author":"AW Roscoe","year":"1987","unstructured":"Roscoe AW, Dathi N: The pursuit of deadlock freedom. Inf Comput 75(3): 289\u2013327 (1987)","journal-title":"Inf Comput"},{"key":"BF01784721_CR26","series-title":"Lect Notes Comput Sci","first-page":"68","volume-title":"Proceedings of 1st Workshop on Automated Verification Methods for Finite State Systems","author":"P Wolper","year":"1989","unstructured":"Wolper P, Lovinfosse V: Verifying properties of large sets of processes with network invariants. In: Sifakis J (ed) Proceedings of 1st Workshop on Automated Verification Methods for Finite State Systems. Lect Notes Comput Sci, vol 407, Springer, Berlin Heidelberg New York 1989, pp 68\u201380"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784721.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01784721\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01784721","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T09:38:49Z","timestamp":1557394729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01784721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01784721"],"URL":"https:\/\/doi.org\/10.1007\/bf01784721","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}