{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T15:45:36Z","timestamp":1764171936696},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,2]],"date-time":"2008-12-02T00:00:00Z","timestamp":1228176000000},"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":[[2009,2]]},"DOI":"10.1007\/s00236-008-0086-z","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T06:48:47Z","timestamp":1228114127000},"page":"73-86","source":"Crossref","is-referenced-by-count":10,"title":["A queue based mutual exclusion algorithm"],"prefix":"10.1007","volume":"46","author":[{"given":"Alex A.","family":"Aravind","sequence":"first","affiliation":[]},{"given":"Wim H.","family":"Hesselink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"key":"86_CR1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ipl.2005.05.015","volume":"96","author":"K. Alagarsamy","year":"2005","unstructured":"Alagarsamy K.: A mutual exclusion algorithm with optimally bounded bypasses. Inf. Process. Lett. 96, 36\u201340 (2005)","journal-title":"Inf. Process. Lett."},{"key":"86_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00446-003-0088-6","volume":"16","author":"J.H. Anderson","year":"2003","unstructured":"Anderson J.H., Kim Y.J., Herman T.: Shared-memory mutual exclusion: major research trends since 1986. Distr. Comput. 16, 75\u2013110 (2003)","journal-title":"Distr. Comput."},{"key":"86_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(90)90048-3","volume":"35","author":"K. Block","year":"1990","unstructured":"Block K., Woo T.-K.: A more efficient generalization of Peterson\u2019s mutual exclusion algorithm. Inf. Process. Lett. 35, 219\u2013222 (1990)","journal-title":"Inf. Process. Lett."},{"key":"86_CR4","volume-title":"Parallel Program Design, A Foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy K.M., Misra J.: Parallel Program Design, A Foundation. Addison-Wesley, Reading (1988)"},{"key":"86_CR5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"Dijkstra E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8, 569 (1965)","journal-title":"Commun. ACM"},{"key":"86_CR6","unstructured":"Frenzel, L.E.: Dual-port SRAM accelerates smart-phone development. Electron. Des. (2004)"},{"key":"86_CR7","first-page":"187","volume-title":"ESOP 86. Lecture notes in computer science, vol 213","author":"J. He","year":"1986","unstructured":"He J., Hoare C.A.R., Sanders J.W.: Data refinement refined. In: Robinet, B., Wilhelm, R. (eds) ESOP 86. Lecture notes in computer science, vol 213, pp. 187\u2013196. Springer, New York (1986)"},{"key":"86_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00165-004-0038-5","volume":"16","author":"W.H. Hesselink","year":"2004","unstructured":"Hesselink W.H.: An assertional proof for a construction of an atomic variable. Formal Asp. Comput. 16, 387\u2013393 (2004)","journal-title":"Formal Asp. Comput."},{"key":"86_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00236-007-0044-1","volume":"44","author":"W.H. Hesselink","year":"2007","unstructured":"Hesselink W.H.: A criterion for atomicity revisited. Acta Inf. 44, 123\u2013151 (2007)","journal-title":"Acta Inf."},{"key":"86_CR10","volume-title":"The SPIN Model Checker, Primer and Reference Manual","author":"G.J. Holzmann","year":"2004","unstructured":"Holzmann G.J.: The SPIN Model Checker, Primer and Reference Manual. Addison-Wesley, Reading (2004)"},{"key":"86_CR11","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1142\/S012962649900044X","volume":"9","author":"Y. Igarashi","year":"1999","unstructured":"Igarashi Y., Nishitani Y.: Speedup of the n-process mutual exclusion algorithm. Parallel Process. Lett. 9, 475\u2013485 (1999)","journal-title":"Parallel Process. Lett."},{"key":"86_CR12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17, 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"key":"86_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport L.: On interprocess communication. Parts I and II. Distr. Comput. 1, 77\u2013101 (1986)","journal-title":"Distr. Comput."},{"key":"86_CR14","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Lamport L.: The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16, 872\u2013923 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"86_CR15","unstructured":"Milner, R.: An algebraic definition of simulation between programs. In: Proc. 2nd Int. Joint Conf. on Artificial Intelligence, pp. 481\u2013489. British Computer Society, UK (1971)"},{"key":"86_CR16","unstructured":"Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS Version 2.4, System Guide, Prover Guide, PVS Language Reference (2001). http:\/\/pvs.csl.sri.com"},{"key":"86_CR17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G.L. Peterson","year":"1981","unstructured":"Peterson G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 12, 115\u2013116 (1981)","journal-title":"Inf. Process. Lett."},{"key":"86_CR18","volume-title":"Algorithms for Mutual Exclusion","author":"M. Raynal","year":"1986","unstructured":"Raynal M.: Algorithms for Mutual Exclusion. MIT Press, Cambridge (1986)"},{"key":"86_CR19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10617-005-1195-3","volume":"9","author":"W.-T. Shiue","year":"2004","unstructured":"Shiue W.-T., Chakrabarti C.: Multi-module multi-port memory design for low power embedded systems. Des. Autom. Embed. Syst. 9, 235\u2013261 (2004)","journal-title":"Des. Autom. Embed. Syst."},{"key":"86_CR20","unstructured":"Springer, C.: Enabling multimode handsets. EE Times, Oct. 2004"},{"key":"86_CR21","volume-title":"Synchronization Algorithms and Concurrent Programming","author":"G. Taubenfeld","year":"2006","unstructured":"Taubenfeld G.: Synchronization Algorithms and Concurrent Programming. Pearson Education\/Prentice Hall, Englewood Cliffs (2006)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0086-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-008-0086-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0086-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:55Z","timestamp":1558705315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-008-0086-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["86"],"URL":"https:\/\/doi.org\/10.1007\/s00236-008-0086-z","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,2]]}}}