{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:29:37Z","timestamp":1754152177776,"version":"3.41.2"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1109\/tc.1982.1675975","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"194-207","source":"Crossref","is-referenced-by-count":29,"title":["The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes"],"prefix":"10.1109","volume":"C-31","author":[{"family":"Kluge","sequence":"first","affiliation":[{"name":"University of Bonn and the Gesellschaft für Mathematik und Datenverarbeitung"}]},{"family":"Lautenbach","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/356698.356702","article-title":"petri-nets","volume":"9","author":"peterson","year":"1977","journal-title":"ACM Comput Surveys"},{"key":"ref3","article-title":"ein kombinatorischer ansatz zur beschreibung und erreichung von fairness in scheduling problemen","volume":"8","author":"lautenbach","year":"1977","journal-title":"Appl Comput Sci"},{"key":"ref10","first-page":"213","author":"genrich","year":"1978","journal-title":"Mathematical Foundations of Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/cp.2011.0612"},{"journal-title":"Liveness in Petri nets","year":"1975","author":"lautenbach","key":"ref11"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-10001-6_22","author":"genrich","year":"1980","journal-title":"Net Theory and Applications Springer Lecture Notes in Computer Science 84"},{"journal-title":"Amdahl 470 Machine Reference Manual","year":"0","key":"ref8"},{"journal-title":"A Guide to the IBM 3031 Processor Complex and Attached Processor Complex of System\/370","year":"1979","key":"ref7"},{"journal-title":"Synchronizers and arbiters","year":"1972","author":"patil","key":"ref2"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/3-540-10001-6_39","author":"genrich","year":"1980","journal-title":"Net Theory and Applications Springer Lecture Notes in Computer Science 84"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICARCV.2006.345114"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35213\/01675975.pdf?arnumber=1675975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:04:26Z","timestamp":1753121066000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1675975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":11,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.1982.1675975","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}