{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T02:30:09Z","timestamp":1674527409980},"reference-count":16,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1997]]},"DOI":"10.1051\/ita\/1997310403051","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:19:22Z","timestamp":1486030762000},"page":"305-330","source":"Crossref","is-referenced-by-count":1,"title":["Calculs approch\u00e9s de la borne inf\u00e9rieure de valeurs r\u00e9parties"],"prefix":"10.1051","volume":"31","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Tel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. CHANDY K. M. et LAMPORT L., Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst., 1985, 3, 1, p. 63-75.","DOI":"10.1145\/214451.214456"},{"key":"R2","unstructured":"2. CHARRON-BOST B., Mesures de la Concurrence et du Parall\u00e9lisme des Calculs R\u00e9partis. Th\u00e8se de doctorat, Universit\u00e9 Paris VII, 1989."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. CHARRON-BOST B., MATTERN F. et TEL G., Synchronous, asynchronous, and causally ordered communication, Distributed Computing, 1996, 9, 4, p. 173-191.1380838","DOI":"10.1007\/s004460050018"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. DIJKSTRA E. W., FEIJEN W. H. J. et VAN GASTEREN A. J. M., Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett., 1983, 16, 5, p. 217-219.0566.68025709657","DOI":"10.1016\/0020-0190(83)90092-3"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. DIJKSTRA E. W. et SCHOLTEN C. S., Termination detection for diffusing computations. Inf. Process. Lett., 1980, 11, 1, p. 1-4.5853940439.68039","DOI":"10.1016\/0020-0190(80)90021-6"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. HUGHES J., A distributed garbage collection algorithm. Dans Functional Programming Language and Computer Architecture, 1985, p. J. P. Jouannaud, Ed., tome 201 de Lecture Notes in Computer Science, Springer-Verlag, p. 256-272.","DOI":"10.1007\/3-540-15975-4_41"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. JEFFERSON D., Virtual time. ACM Trans. Program. Lang. Syst., 1985, 7, 3, p. 404-425.","DOI":"10.1145\/3916.3988"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. LAI T. H. et YANG T. H., On distributed snapshots. Inf. Process. Lett., 1987, 25, p. 153-158.8964090653.68008","DOI":"10.1016\/0020-0190(87)90125-6"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. LAMPORT L., Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 1978, 21, p. 558-564.0378.68027","DOI":"10.1145\/359545.359563"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. MATTERN F., Algorithms for distributed termination detection. Distributed Computing, 1987, 2, 3, p. 161-175.","DOI":"10.1007\/BF01782776"},{"key":"R11","unstructured":"11. MATTERN F., MEHL H., SCHOONE A. A. et TEL G., Global virtual time approximation with distributed termination detection algorithms. Rapport RUU-CS-91-32, Dept d'Informatique, Universit\u00e9 d'Utrecht, Pays Bas, Sept. 1991."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. SARIN S. K. et LYNCH N. A., Discarding obsolete information in a replicated database system. IEEE Trans. Softw. Eng. SE-13, 1987, p. 39-47.","DOI":"10.1109\/TSE.1987.232564"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. SCHIPER A., EGGLI J. et SANDOZ A., A new algorithm to implement causal ordering. Dans Int. Workshop on Distributed Algorithms, 1989, p. J.-C. Bermond et M. Raynal, Eds., tome 392 de Lecture Notes in Computer Science, Springer-Verlag, p. 219-232.","DOI":"10.1007\/3-540-51687-5_45"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. Schwartz R. et MATTERN F., Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing, 1994, 7, 3, p. 149-174.0813.68096","DOI":"10.1007\/BF02277859"},{"key":"R15","unstructured":"15. TEL G., Topics in Distributed Algorithms, tome 1 de Cambridge Int. Series on Parallel Computation. Cambridge University Press, Cambridge, 1991.0755.68062"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. TEL G., Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, 1994.0826.68056","DOI":"10.1007\/BFb0020419"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310403051\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:02:09Z","timestamp":1568772129000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310403051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":16,"journal-issue":{"issue":"4"},"alternative-id":["ita1997310403051"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1997310403051","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}