{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:02:05Z","timestamp":1648926125961},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T00:00:00Z","timestamp":1217289600000},"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":[[2008,9]]},"DOI":"10.1007\/s00446-008-0065-1","type":"journal-article","created":{"date-parts":[[2008,7,28]],"date-time":"2008-07-28T10:31:34Z","timestamp":1217241094000},"page":"163-181","source":"Crossref","is-referenced-by-count":1,"title":["Implementing dataflow with threads"],"prefix":"10.1007","volume":"21","author":[{"given":"Leslie","family":"Lamport","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,29]]},"reference":[{"key":"65_CR1","unstructured":"Alpha Architecture Committee: Alpha Architecture Reference Manual, 3rd edn. Digital Press, Boston (1998)"},{"issue":"6","key":"65_CR2","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F. Commoner","year":"1971","unstructured":"Commoner F., Holt A.W., Even S., Pnueli A.: Marked directed graphs. J. Comput. Syst. Sci. 5(6), 511\u2013523 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"65_CR3","volume-title":"Programming Languages","author":"E.W. Dijkstra","year":"1968","unstructured":"Dijkstra E.W.: Cooperating sequential processes. In: Genuys, F.(eds) Programming Languages, Academic Press, New York (1968)"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Hill, J.M.D., Skillicorn, D.B.: Practical barrier synchronisation. In: 6th Euromicro Workshop on Parallel and Distributed Processing. IEEE, Computer Society Press (1998)","DOI":"10.1109\/EMPDP.1998.647231"},{"key":"65_CR5","unstructured":"Lamport, L.: The + CAL algorithm language. URL http:\/\/research.microsoft.com\/users\/lamport\/tla\/pluscal.html . The page can also be found by searching the Web for the 25-letter string obtained by removing the \u201c\u2013\u201d from uid-lamportpluscalhomepage."},{"issue":"2","key":"65_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"SE-3","author":"L. Lamport","year":"1977","unstructured":"Lamport L.: Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3(2), 125\u2013143 (1977)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"9","key":"65_CR7","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"Lamport L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"65_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport L.: On interprocess communication. Distrib. Comput. 1, 77\u2013101 (1986)","journal-title":"Distrib. Comput."},{"issue":"2\u20133","key":"65_CR9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00446-002-0076-2","volume":"16","author":"L. Lamport","year":"2003","unstructured":"Lamport L.: Arbiter-free synchronization. Distrib. Comput. 16(2\u20133), 219\u2013237 (2003)","journal-title":"Distrib. Comput."},{"key":"65_CR10","unstructured":"Lamport, L.: Specifying Systems. Addison-Wesley, Boston (2003). Also available on the Web via a link at http:\/\/lamport.org"},{"key":"65_CR11","unstructured":"Lamport, L., Schneider, F.B.: Pretending atomicity. Research Report 44, Digital Equipment Corporation, Systems Research Center (1989)"},{"issue":"1","key":"65_CR12","first-page":"272","volume":"9","author":"J.M. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey J.M., Scott M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 272\u2013314 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"65_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03687-7","volume-title":"Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets","author":"W. Reisig","year":"1998","unstructured":"Reisig W.: Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer, Heidelberg (1998)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0065-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0065-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0065-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:37Z","timestamp":1559136397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0065-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,29]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["65"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0065-1","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,29]]}}}