{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:04:32Z","timestamp":1649185472775},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1007\/bf00289712","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T05:00:10Z","timestamp":1096952410000},"page":"585-598","source":"Crossref","is-referenced-by-count":2,"title":["Deadlock-freedom in resource contentions"],"prefix":"10.1007","volume":"21","author":[{"given":"Marina C.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Martin","family":"Rem","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. Amsterdam: North-Holland 1973"},{"key":"CR2","series-title":"Technical Report 4684","volume-title":"A characterization of deadlock free resource contentions","author":"M.C. Chen","year":"1982","unstructured":"Chen, M.C., Graham, R.L., Rem, M.: A characterization of deadlock free resource contentions. Technical Report 4684, Computer Science Department, California Institute of Technology. Pasadena, CA 1982"},{"key":"CR3","first-page":"43","volume-title":"Programming Languages","author":"E.W. Dijkstra","year":"1968","unstructured":"Dijkstra, E.W.: Cooperating sequential processes. In: Programming Languages, pp. 43?112. F. Genuys (ed.). New York: Academic Press 1968"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W. Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf. 1, 115?138 (1971)","journal-title":"Acta Inf."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/363156.363160","volume":"12","author":"A.N. Habermann","year":"1969","unstructured":"Habermann, A.N.: Prevention of system deadlocks. Commun. ACM 12, 373?377, 385 (1969)","journal-title":"Commun. ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26?30 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/356603.356607","volume":"4","author":"R.C. Holt","year":"1972","unstructured":"Holt, R.C.: Some deadlock properties of computer systems. Comput. Surv. 4, 179?196 (1972)","journal-title":"Comput. Surv."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225?231 (1973)","journal-title":"SIAM J. Comput."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/TC.1982.1675974","volume":"31","author":"T. Ibaraki","year":"1982","unstructured":"Ibaraki, T., Kameda, T.: Deadlock-free systems for a bounded number of processes. IEEE Trans. Comput. 31, 188?193 (1982)","journal-title":"IEEE Trans. Comput."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/322186.322192","volume":"27","author":"T. Kameda","year":"1980","unstructured":"Kameda, T.: Testing deadlock-freedom of computer systems. J. Assoc. Comput. Mach. 27, 270?280 (1980)","journal-title":"J. Assoc. Comput. Mach"},{"key":"CR11","volume-title":"Introduction to VLSI Systems","author":"C.A. Mead","year":"1980","unstructured":"Mead, C.A., Conway, L.A.: Introduction to VLSI Systems. Reading, MA: Addison Wesley 1980"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289712.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289712\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:15:02Z","timestamp":1554758102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["BF00289712"],"URL":"https:\/\/doi.org\/10.1007\/bf00289712","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}