{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:06Z","timestamp":1725456066687},"publisher-location":"Berlin\/Heidelberg","reference-count":28,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354015650X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015731","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:45:47Z","timestamp":1132724747000},"page":"63-70","source":"Crossref","is-referenced-by-count":3,"title":["Repeated synchronous snapshots and their implementation in CSP"],"prefix":"10.1007","author":[{"given":"Luc","family":"Boug\u00e9","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"K.R. Apt and Ph. Clermont, Two normal form theorems for CSP programs, in preparation (1984)"},{"key":"6_CR2","volume-title":"Real time clocks versus virtual clocks, Rept. No. 84-34","author":"K.R. Apt","year":"1984","unstructured":"K.R. Apt and J.L. Richier, Real time clocks versus virtual clocks, Rept. No. 84-34, LITP, Univ. Paris 7, Paris (1984)."},{"key":"6_CR3","unstructured":"L. Boug\u00e9, Symmetric election in CSP, Rept. No. 84-31, LITP, Univ. Paris 7, Paris (1984), submitted for publication."},{"key":"6_CR4","volume-title":"More about the snapshot algorithm: repeated synchronous snapshots and their implementation in CSP, Rept. No. 84-56","author":"L. Boug\u00e9","year":"1984","unstructured":"L. Boug\u00e9, More about the snapshot algorithm: repeated synchronous snapshots and their implementation in CSP, Rept. No. 84-56, LITP, Univ. Paris 7, Paris (1984)."},{"key":"6_CR5","volume-title":"Symmetry and Genericity for CSP distributed system, Rept. No. 85-","author":"L. Boug\u00e9","year":"1985","unstructured":"L. Boug\u00e9, Symmetry and Genericity for CSP distributed system, Rept. No. 85-, LITP, Univ. Paris 7, Paris (1985) in preparation."},{"key":"6_CR6","unstructured":"K.M. Chandy, Paradigms for distributed computing, in: Proc. 3rd Conf. on Found. of Soft. Technology and Theory of Computer Science, Bengalore, India (1983) 192\u2013201."},{"key":"6_CR7","volume-title":"Distributed snapshots: determining the global state of distributed systems, Rept. No. TR-LCS-8401","author":"K.M. Chandy","year":"1984","unstructured":"K.M. Chandy and L. Lamport, Distributed snapshots: determining the global state of distributed systems, Rept. No. TR-LCS-8401, Univ. Texas, Austin, Texas (jan. 1984) submitted for publication (1984)."},{"key":"6_CR8","unstructured":"E.W. Dijkstra, The distributed snapshot algorithm of K.M. Chandy and L. Lamport, Letter No. EWD864a (1983)."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E.W. Dijkstra","year":"1983","unstructured":"E.W. Dijkstra, W.H.J. Feijen and A.J.M. van Gasteren, Derivation of a termination detection algorithm for distributed computations, Inf. Proc. Letters 16 (1983) 217\u2013219.","journal-title":"Inf. Proc. Letters"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E.W. Dijkstra","year":"1980","unstructured":"E.W. Dijkstra and C.S. Scholten, Termination detection for diffusing computations, Inf. Proc. Letters 11 (1980) 1\u20134.","journal-title":"Inf. Proc. Letters"},{"key":"6_CR11","volume-title":"A model-theoritic analysis of knowledge: extended abstract","author":"R. Fagin","year":"1984","unstructured":"R. Fagin, J.Y. Halpern and M.Y. Vardi, A model-theoritic analysis of knowledge: extended abstract, IBM Research Laboratory, San Jose, Calif. (1984)."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"N. Francez, Distributed termination, ACM Trans. Prog. Lang. Syst. 2 (1980) 42\u201355.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TSE.1982.235257","volume":"SE-8","author":"N. Francez","year":"1982","unstructured":"N. Francez and M. Rodeh, Achieving distributed termination without freezing, IEEE Trans. Soft. Eng. SE-8 (1982) 287\u2013292.","journal-title":"IEEE Trans. Soft. Eng."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. Int. Coll. on Formalization of Programming Concepts, Peniscola, Spain","author":"N. Francez","year":"1981","unstructured":"N. Francez, M. Rodeh and M. Sintzoff, Distributed termination with interval assertion, in: J. Diaz and I. Ramos, eds., Proc. Int. Coll. on Formalization of Programming Concepts, Peniscola, Spain, Lecture Notes in Computer Science 107 (Springer, Berlin, 1981)."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"C.A.R. Hoare, Communicating sequential processes, Comm. ACM 21 (1978) 666\u2013677.","journal-title":"Comm. ACM"},{"key":"6_CR16","volume-title":"A distributed algorithm to detect and\/or deadlock, Rept. No. TR LCS-8301","author":"T. Herman","year":"1983","unstructured":"T. Herman and K.M. Chandy, A distributed algorithm to detect and\/or deadlock, Rept. No. TR LCS-8301, Dept. of Computer Science, Univ. of Texas, Austin, Texas (1983)."},{"key":"6_CR17","volume-title":"Common knowledge in a distributed environment","author":"J. Halpern","year":"1984","unstructured":"J. Halpern and Y. Moses, Common knowledge in a distributed environment, Computer Science Dpt., Stanford Univ., Calif. (1984)."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, Time, clocks and the ordering of events in a distributed system, Comm. ACM 21 (1978) 558\u2013565.","journal-title":"Comm. ACM"},{"key":"6_CR19","volume-title":"Lecture Notes prepared for the Advanced Course on Distributed Systems \u2014 Methods and Tools for Specification","author":"L. L","year":"1984","unstructured":"L. Lamport, Lecture Notes prepared for the Advanced Course on Distributed Systems \u2014 Methods and Tools for Specification, Computer Science Inst., TUM, Munchen, Germany (1984)."},{"key":"6_CR20","volume-title":"Knowledge, common knowledge and related puzzles (extended summary)","author":"D. Lehmann","year":"1984","unstructured":"D. Lehmann, Knowledge, common knowledge and related puzzles (extended summary), Inst. of Math. and Computer Science, Hebrew Univ., Jerusalem, Israel (1984)."},{"key":"6_CR21","unstructured":"G. Le Lann, Distributed systems \u2014 towards a formal approach, in: B. Gilchrist, ed., Information Processing 77 (North-Holland, Amsterdam, 1977) 155\u2013160."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"C. Morgan, Global and logical time in distributed systems, Inf. Proc. Letters (1985), to appear.","DOI":"10.1016\/0020-0190(85)90048-1"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/357153.357156","volume":"4","author":"J. Misra","year":"1982","unstructured":"J. Misra and K.M. Chandy, Termination detection of diffusing computations in communicating sequential processes, ACM Trans. Prog. Lang. Syst. 4 (1982) 37\u201342.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"6_CR24","first-page":"185","volume-title":"Formal Description of Programming Concepts, IFIP TC-2 Working Conference","author":"G. Plotkin","year":"1982","unstructured":"G. Plotkin, An operational semantics for CSP, in: D. Bjorner, ed., Formal Description of Programming Concepts, IFIP TC-2 Working Conference, Garmish-Partenkirchen, Germany (1982) 185\u2013208."},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0020-0190(83)90089-3","volume":"17","author":"S.P. Rana","year":"1983","unstructured":"S.P. Rana, A distributed solution to the distributed termination problem, Inf. Proc. Letters 17 (1983) 43\u201346.","journal-title":"Inf. Proc. Letters"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/3-540-13345-3_37","volume-title":"Automata, Languages and Programming","author":"W. Reisig","year":"1984","unstructured":"W. Reisig, Partial order semantics for CSP-like languages and its impact on fairness, in: J. Paradaens, ed., Automata, Languages and Programming, Lecture Notes in Computer Science 172 (Springer, Berlin, 1984) 403\u2013413."},{"key":"6_CR27","volume-title":"Distributed termination in CSP \u2014 symmetric solution with minimal storage, Rept. No. 84-49","author":"J.L. Richier","year":"1984","unstructured":"J.L. Richier, Distributed termination in CSP \u2014 symmetric solution with minimal storage, Rept. No. 84-49, LITP, Univ. Paris 7, Paris (1984)."},{"key":"6_CR28","volume-title":"Lecture Notes prepared for the Advanced Course on Distributed Systems \u2014 Methods and Tools for Specification","author":"F.B. Schneider","year":"1984","unstructured":"F.B. Schneider, Lecture Notes prepared for the Advanced Course on Distributed Systems \u2014 Methods and Tools for Specification, Inst. for Computer Science, TUM, Munchen, Germany (1984)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015731.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:09:49Z","timestamp":1607353789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0015731","relation":{},"subject":[]}}