{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:41:26Z","timestamp":1725518486117},"publisher-location":"Dordrecht","reference-count":14,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402088889"},{"type":"electronic","value":"9781402088896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-1-4020-8889-6_11","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T12:40:42Z","timestamp":1221309642000},"page":"97-104","source":"Crossref","is-referenced-by-count":1,"title":["Towards the Application of Process Calculi in the Domain of Peer-to-Peer Algorithms"],"prefix":"10.1007","author":[{"given":"Sven","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Borgstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Nestmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1_11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.entcs.2007.01.052","volume":"181","author":"R. Bakhshi","year":"2007","unstructured":"R. Bakhshi and D. Gurov. Verification of peer-to-peer algorithms: A case study. Electr. Notes Theor. Comput. Sci., 181:35-47, 2007.","journal-title":"Electr. Notes Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"J. Borgstr \u00f6m, U. Nestmann, L. Onana Alima, and D. Gurov. Verifying a structured peer- to-peer overlay network: The static case. Global Computing, volume 3267 of LNCS, pages 250-265. Springer, 2004.","key":"11_CR2_11","DOI":"10.1007\/978-3-540-31794-4_13"},{"issue":"2","key":"11_CR3_11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"M. J. Fischer, N. A. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, 1985.","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"A. Francalanza and M. Hennessy. A fault tolerance bisimulation proof for consensus (extended abstract). ESOP, volume 4421 of LNCS, pages 395-410. Springer, 2007.","key":"11_CR4_11","DOI":"10.1007\/978-3-540-71316-6_27"},{"unstructured":"N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. USENIX Symposium on Internet Technologies and Systems, 2003.","key":"11_CR5_11"},{"key":"11_CR6_11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611063","volume-title":"A Distributed Picalculus","author":"M. Hennessy","year":"2007","unstructured":"M. Hennessy. A Distributed Picalculus. Cambridge University Press, Cambridge, 2007."},{"doi-asserted-by":"crossref","unstructured":"H. Hermanns. Interactive Markov Chains: The Quest for Quantified Quality, volume 2428 of LNCS. Springer, 2002.","key":"11_CR7_11","DOI":"10.1007\/3-540-45804-2_4"},{"doi-asserted-by":"crossref","unstructured":"D. Liben-Nowell, H. Balakrishnan, and D. R. Karger. Analysis of the evolution of peer-to-peer systems. PODC, pages 233-242, 2002.","key":"11_CR8_11","DOI":"10.1145\/571825.571863"},{"key":"11_CR9_11","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"N. Lynch. Distributed Algorithms. Morgan Kaufmann, San Mateo, CA, 1996."},{"unstructured":"R. Milner. Communicating and Mobile Systems: The \u03c0 -Calculus. Cambridge University Press, 1999.","key":"11_CR10_11"},{"doi-asserted-by":"crossref","unstructured":"L. Onana Alima, S. El-Ansary, P. Brand, and S. Haridi. DKS (N, k, f): A family of low communication, scalable and fault-tolerant infrastructures for p2p applications. In CCGRID, pages 344-350. IEEE Computer Society, 2003.","key":"11_CR11_11","DOI":"10.1109\/CCGRID.2003.1199386"},{"doi-asserted-by":"crossref","unstructured":"A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Middleware, volume 2218 of LNCS, pages 329-350. Springer, 2001.","key":"11_CR12_11","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"1","key":"11_CR13_11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw., 11(1):17-32, 2003.","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"11_CR14_11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B. Y. Zhao","year":"2004","unstructured":"B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1):41-53, 2004.","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Autonomous Systems \u2013 Self-Organization, Management, and Control"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-8889-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T17:24:24Z","timestamp":1605633864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-8889-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9781402088889","9781402088896"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-8889-6_11","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}