{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:45:47Z","timestamp":1742395547173},"reference-count":31,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90005-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"145-169","source":"Crossref","is-referenced-by-count":39,"title":["Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP"],"prefix":"10.1016","volume":"49","author":[{"given":"Luc","family":"Boug\u00e9","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90005-3_BIB1","series-title":"Rept. No. RC10975","article-title":"Two normal form theorems for CSP programs","author":"Apt","year":"1985"},{"key":"10.1016\/0304-3975(87)90005-3_BIB2","series-title":"NATO ASI Series F 14, Control Flow and Data Flow: Concepts of Distributed Programming","first-page":"475","article-title":"Real time clocks versus virtual clocks","author":"Apt","year":"1985"},{"key":"10.1016\/0304-3975(87)90005-3_BIB3","article-title":"On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes","volume":"7","author":"Boug\u00e9","year":"1986"},{"key":"10.1016\/0304-3975(87)90005-3_BIB4","article-title":"Symmetry and genericity for CSP distributed system","volume":"7","author":"Boug\u00e9","year":"1985"},{"key":"10.1016\/0304-3975(87)90005-3_BIB5","first-page":"192","article-title":"Paradigms for distributed computing","author":"Chandy","year":"1983","journal-title":"Proc. 3rd Conf. on Foundations of Software Technology and Theory of Computer Science"},{"issue":"1","key":"10.1016\/0304-3975(87)90005-3_BIB6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: determining the global state of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Computer. Systems"},{"key":"10.1016\/0304-3975(87)90005-3_BIB7","series-title":"Rept. No. TR-85-02","article-title":"A paradigm for detecting quiescent properties of distributed computations","author":"Chandy","year":"1985"},{"key":"10.1016\/0304-3975(87)90005-3_BIB8","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF01843569","article-title":"How processes learn","volume":"1","author":"Chandy","year":"1986","journal-title":"Distr. Comput."},{"key":"10.1016\/0304-3975(87)90005-3_BIB9","article-title":"The distributed snapshot algorithm","author":"Dijkstra","year":"1983","journal-title":"Letter No. EWD864a"},{"key":"10.1016\/0304-3975(87)90005-3_BIB10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","article-title":"Derivation of a termination detection algorithm for distributed computations","volume":"16","author":"Dijkstra","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90005-3_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","article-title":"Termination detection for diffusing computations","volume":"11","author":"Dijkstra","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90005-3_BIB12","first-page":"268","article-title":"A model-theoretic analysis of knowledge: extended abstract","author":"Fagin","year":"1984","journal-title":"Proc. Symp. Foundation of Computer Science"},{"key":"10.1016\/0304-3975(87)90005-3_BIB13","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","article-title":"Distributed termination","volume":"2","author":"Francez","year":"1980","journal-title":"ACM Trans. Programm. Lang. Systems"},{"key":"10.1016\/0304-3975(87)90005-3_BIB14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TSE.1982.235257","article-title":"Achieving distributed termination without freezing","volume":"SE-8","author":"Francez","year":"1982","journal-title":"IEEE Trans. Soft. Eng."},{"key":"10.1016\/0304-3975(87)90005-3_BIB15","series-title":"Proc. Internat. Coll. on Formalization of Programming Concepts","article-title":"Distributed termination with interval assertion","volume":"107","author":"Francez","year":"1981"},{"key":"10.1016\/0304-3975(87)90005-3_BIB16","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(87)90005-3_BIB17","series-title":"Rept. No. TR LCS-8301","article-title":"A distributed algorithm to detect and\/or deadlock","author":"Herman","year":"1983"},{"key":"10.1016\/0304-3975(87)90005-3_BIB18","first-page":"50","article-title":"Knowledge and common knowledge in a distributed environment","author":"Halpern","year":"1984","journal-title":"Proc. 3rd Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(87)90005-3_BIB19","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(87)90005-3_BIB20","series-title":"Lecture notes prepared for the Advanced Course on Distributed Systems\u2014Methods and Tools for Specification","author":"Lamport","year":"1984"},{"key":"10.1016\/0304-3975(87)90005-3_BIB21","first-page":"62","article-title":"Knowledge, common knowledge and related puzzles","author":"Lehmann","year":"1984","journal-title":"Proc. 3rd Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(87)90005-3_BIB22","series-title":"Information Processing 77","first-page":"155","article-title":"Distributed systems\u2014towards a formal approach","author":"Le Lann","year":"1977"},{"key":"10.1016\/0304-3975(87)90005-3_BIB23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(85)90048-1","article-title":"Global and logical time in distributed systems","volume":"20","author":"Morgan","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90005-3_BIB24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/357153.357156","article-title":"Termination detection of diffusing computations in communicating sequential processes","volume":"4","author":"Misra","year":"1982","journal-title":"ACM Trans. Programm. Lang. Systems"},{"key":"10.1016\/0304-3975(87)90005-3_BIB25","series-title":"Formal Description of Programming Concepts, IFIP TC-2 Working Conference","first-page":"185","article-title":"An operational semantics for CSP","author":"Plotkin","year":"1982"},{"key":"10.1016\/0304-3975(87)90005-3_BIB26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(83)90089-3","article-title":"A distributed solution to the destributed termination problem","volume":"17","author":"Rana","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(87)90005-3_BIB27","series-title":"Proc. Internat. Coll. on Automata, Languages and Programming","first-page":"403","article-title":"Partial order semantics for CSP-like languages and its impact on fairness","volume":"172","author":"Reisig","year":"1984"},{"key":"10.1016\/0304-3975(87)90005-3_BIB28","series-title":"Monography EATCS","article-title":"An Introduction to Petri Nets","author":"Reisig","year":"1985"},{"key":"10.1016\/0304-3975(87)90005-3_BIB29","article-title":"Distributed termination in CSP-symmetric solution with minimal storage","volume":"7","author":"Richier","year":"1984"},{"key":"10.1016\/0304-3975(87)90005-3_BIB30","series-title":"Lecture notes prepared for the Advanced Course on Distributed Systems\u2014Methods and Tools for Specification","author":"Schneider","year":"1984"},{"key":"10.1016\/0304-3975(87)90005-3_BIB31","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-16761-7_84","article-title":"Efficient detection of locally-indicative stable properties","author":"Shavit","year":"1986","journal-title":"Proc. 13th Internat. Coll. on Automata, Languages and Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:42Z","timestamp":1555127502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900053"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90005-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}