{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:14:05Z","timestamp":1725531245913},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642016387"},{"type":"electronic","value":"9783642016394"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01639-4_40","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T06:12:15Z","timestamp":1240207935000},"page":"416-421","source":"Crossref","is-referenced-by-count":2,"title":["A Distributed Computational Model for Mobile Agents"],"prefix":"10.1007","author":[{"given":"Med Amine","family":"Haddar","sequence":"first","affiliation":[]},{"given":"Ahmed","family":"Hadj Kacem","sequence":"additional","affiliation":[]},{"given":"Yves","family":"M\u00e9tivier","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Mosbah","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Jmaiel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/9789812814951_0001","volume-title":"Handbook of graph grammars and computing by graph transformation","author":"I. Litovsky","year":"1999","unstructured":"Litovsky, I., M\u00e9tivier, Y., Sopena, E.: Handbook of graph grammars and computing by graph transformation, vol.\u00a03, pp. 1\u201356. World Scientific, Singapore (1999)"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Abbas, S., Mosbah, M., Zemmari, A.: Distributed computation of a spanning tree in a dynamic graph by mobile agents. In: IEEE International Conference on Engineering of Intelligent Systems, pp. 425\u2013430 (2006)","DOI":"10.1109\/ICEIS.2006.1703205"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/3-540-36265-7_54","volume-title":"High Performance Computing - HiPC 2002","author":"L. Pan","year":"2002","unstructured":"Pan, L., Bic, L., Dillencourt, M.B., Lai, M.K.: Mobile agents - the right vehicle for distributed sequential computing. In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol.\u00a02552, pp. 575\u2013584. Springer, Heidelberg (2002)"},{"issue":"1","key":"40_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci.\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-44968-X_24","volume-title":"Computing and Combinatorics","author":"S. Ghosh","year":"2000","unstructured":"Ghosh, S.: Agents, distributed algorithms, and stabilization. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 242\u2013251. Springer, Heidelberg (2000)"},{"key":"40_CR6","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.\u00a04305, pp. 187\u2013201. Springer, Heidelberg (2006)"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-77444-0_28","volume-title":"Distributed Computing and Networking","author":"M.A. Haddar","year":"2008","unstructured":"Haddar, M.A., Kacem, A.H., M\u00e9tivier, Y., Mosbah, M., Jmaiel, M.: Proving distributed algorithms for mobile agents: Examples of spanning tree computation in anonymous networks. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol.\u00a04904, pp. 286\u2013291. Springer, Heidelberg (2008)"},{"issue":"3","key":"40_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S1571-0661(04)00174-4","volume":"50","author":"M. Bauderon","year":"2001","unstructured":"Bauderon, M., Gruner, S., Metivier, Y., Mosbah, M., Sellami, A.: Visualization of distributed algorithms based on graph relabelling systems. Electronic Notes in Theoretical Computer Science\u00a050(3), 227\u2013237 (2001)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"40_CR9","unstructured":"Haddar, M.A., Kacem, A.H., Mosbah, M., M\u00e9tivier, Y., Jmaiel, M.: Distributed algorithms for mobile agents. Technical report, Universit\u00e9 Bordeaux1 (2007)"}],"container-title":["Lecture Notes in Computer Science","Agent Computing and Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01639-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T16:51:41Z","timestamp":1551977501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01639-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642016387","9783642016394"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01639-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}