{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:11:07Z","timestamp":1742919067087,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_16","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T23:30:06Z","timestamp":1507246206000},"page":"234-249","source":"Crossref","is-referenced-by-count":0,"title":["How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults"],"prefix":"10.1007","author":[{"given":"Tsuyoshi","family":"Gotoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 200\u2013209. ACM (2002)","DOI":"10.1145\/564870.564906"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11780823_7","volume-title":"Structural Information and Communication Complexity","author":"L Blin","year":"2006","unstructured":"Blin, L., Fraigniaud, P., Nisse, N., Vial, S.: Distributed chasing of network intruders. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 70\u201384. Springer, Heidelberg (2006). doi: 10.1007\/11780823_7"},{"key":"16_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9781118135617","volume-title":"Mobile Agents in Networking and Distributed Computing","author":"J Cao","year":"2012","unstructured":"Cao, J., Das, S.K.: Mobile Agents in Networking and Distributed Computing. Wiley, Hoboken (2012)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11945529_14","volume-title":"Principles of Distributed Systems","author":"J Chalopin","year":"2006","unstructured":"Chalopin, J., Godard, E., M\u00e9tivier, Y., Ossamy, R.: Mobile agent algorithms versus message passing algorithms. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 187\u2013201. Springer, Heidelberg (2006). doi: 10.1007\/11945529_14"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-72951-8_23","volume-title":"Structural Information and Communication Complexity","author":"S Das","year":"2007","unstructured":"Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Fault-tolerant simulation of message-passing algorithms by mobile agents. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 289\u2013303. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72951-8_23"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-92221-6_29","volume-title":"Principles of Distributed Systems","author":"S Das","year":"2008","unstructured":"Das, S., Mihal\u00e1k, M., \u0160r\u00e1mek, R., Vicari, E., Widmayer, P.: Rendezvous of mobile agents when tokens fail anytime. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 463\u2013480. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-92221-6_29"},{"issue":"12","key":"16_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.ipl.2012.03.017","volume":"112","author":"Y Dieudonn\u00e9","year":"2012","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Deterministic network exploration by a single agent with byzantine tokens. Inf. Process. Lett. 112(12), 467\u2013470 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-006-0154-y","volume":"19","author":"S Dobrev","year":"2006","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distrib. Comput. 19(1), 1\u201318 (2006)","journal-title":"Distrib. Comput."},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5173-9","volume-title":"Distributed Graph Algorithms for Computer Networks","author":"K Erciyes","year":"2013","unstructured":"Erciyes, K.: Distributed Graph Algorithms for Computer Networks. Springer Science & Business Media, London (2013). doi: 10.1007\/978-1-4471-5173-9"},{"issue":"03","key":"16_CR10","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1142\/S0129054107004838","volume":"18","author":"P Flocchini","year":"2007","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Decontaminating chordal rings and tori using mobile agents. Int. J. Found. Comput. Sci. 18(03), 547\u2013563 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2\u20133","key":"16_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.tcs.2007.04.024","volume":"384","author":"R Klasing","year":"2007","unstructured":"Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Theoret. Comput. Sci. 384(2\u20133), 201\u2013221 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"03","key":"16_CR12","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1142\/S0129054107004784","volume":"18","author":"F Luccio","year":"2007","unstructured":"Luccio, F., Pagli, L., Santoro, N.: Network decontamination in presence of local immunity. Int. J. Found. Comput. Sci. 18(03), 457\u2013474 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20133","key":"16_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2007.11.007","volume":"393","author":"T Suzuki","year":"2008","unstructured":"Suzuki, T., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Move-optimal gossiping among mobile agents. Theoret. Comput. Sci. 393(1\u20133), 90\u2013101 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to Distributed Algorithms","author":"G Tel","year":"2000","unstructured":"Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2000)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:17:03Z","timestamp":1570166223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}