{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:15:11Z","timestamp":1772835311221,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642288685","type":"print"},{"value":"9783642288692","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28869-2_15","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T16:44:36Z","timestamp":1332434676000},"page":"295-315","source":"Crossref","is-referenced-by-count":44,"title":["A Process Algebra for Wireless Mesh Networks"],"prefix":"10.1007","author":[{"given":"Ansgar","family":"Fehnker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Glabbeek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"H\u00f6fner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annabelle","family":"McIver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Portmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee Lum","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Kernel AODV (v. 2.2.2), NIST, \n                  \n                    http:\/\/www.antd.nist.gov\/wctg\/aodv_kernel\/\n                  \n                  \n                 (accessed January 6, 2012)"},{"key":"15_CR2","unstructured":"AODV-UU: An implementation of the AODV routing protocol (IETF RFC 3561), \n                  \n                    http:\/\/sourceforge.net\/projects\/aodvuu\/\n                  \n                  \n                 (accessed January 6, 2012)"},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/581771.581775","volume":"49","author":"K. Bhargavan","year":"2002","unstructured":"Bhargavan, K., Obradovic, D., Gunter, C.A.: Formal verification of standards for distance vector routing protocols. J. ACM\u00a049(4), 538\u2013576 (2002), \n                  \n                    http:\/\/dx.doi.org\/10.1145\/581771.581775","journal-title":"J. ACM"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., L\u00fcttgen, G., Natarajan, V.: Priority in process alegbra. In: Handbook of Process Algebra, ch.12, pp. 711\u2013765. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50030-8"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-85361-9_35","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S. Cranen","year":"2008","unstructured":"Cranen, S., Mousavi, M.R., Reniers, M.A.: A Rule Format for Associativity. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 447\u2013461. Springer, Heidelberg (2008)"},{"key":"15_CR6","unstructured":"Fehnker, A., van Glabbeek, R.J., H\u00f6fner, P., McIver, A., Portmann, M., Tan, W.L.: A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV. Tech. Rep. 5513, NICTA (2012), \n                  \n                    http:\/\/www.nicta.com.au\/pub?id=5513"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Ghassemi, F., Fokkink, W.J., Movaghar, A.: Restricted broadcast process theory. In: Proc. IEEE SEFM 2008 (2008)","DOI":"10.1109\/SEFM.2008.25"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-72794-1_8","volume-title":"Coordination Models and Languages","author":"J.C.. Godskesen","year":"2007","unstructured":"Godskesen, J.C.: A Calculus for Mobile Ad Hoc Networks. In: Murphy, A.L., Ryan, M. (eds.) COORDINATION 2007. LNCS, vol.\u00a04467, pp. 132\u2013150. Springer, Heidelberg (2007)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-1-4471-2120-6_2","volume-title":"Algebra of Communicating Processes 1994. Workshops in Computing","author":"J.F. Groote","year":"1995","unstructured":"Groote, J.F., Ponse, A.: The syntax and semantics of \u03bcCRL. In: Algebra of Communicating Processes 1994. Workshops in Computing, pp. 26\u201362. Springer, Heidelberg (1995)"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1109\/MWC.2010.5416357","volume":"17","author":"G.R. Hiertz","year":"2010","unstructured":"Hiertz, G.R., Denteneer, D., Max, S., Taori, R., Cardona, J., Berlemann, L., Walke, B.: IEEE 802.11s: the WLAN mesh standard. IEEE Wireless Communications\u00a017(1), 104\u2013111 (2010), \n                  \n                    http:\/\/dx.doi.org\/10.1109\/MWC.2010.5416357","journal-title":"IEEE Wireless Communications"},{"issue":"3","key":"15_CR11","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"Lynch, N., Tuttle, M.: An introduction to input\/output automata. CWI-Quarterly\u00a02(3), 219\u2013246 (1989); centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands","journal-title":"CWI-Quarterly"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ic.2007.11.010","volume":"207","author":"M. Merro","year":"2009","unstructured":"Merro, M.: An observational theory for mobile ad hoc networks. Inf. Comput.\u00a0207(2), 194\u2013208 (2009)","journal-title":"Inf. Comput."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.entcs.2006.04.017","volume":"158","author":"N. Mezzetti","year":"2006","unstructured":"Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. Electr. Notes Theor. Comput. Sci.\u00a0158, 331\u2013353 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Miskovic, S., Knightly, E.W.: Routing primitives for wireless mesh networks: Design, analysis and experiments. In: IEEE INFOCOM, pp. 2793\u20132801 (2010), \n                  \n                    http:\/\/dx.doi.org\/10.1109\/INFCOM.2010.5462111","DOI":"10.1109\/INFCOM.2010.5462111"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2006.08.036","volume":"367","author":"S. Nanz","year":"2006","unstructured":"Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci.\u00a0367, 203\u2013227 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Perkins, C., Belding-Royer, E., Das, S.: Ad hoc on-demand distance vector (AODV) routing. RFC 3561 (2003), \n                  \n                    http:\/\/www.ietf.org\/rfc\/rfc3561.txt","DOI":"10.17487\/rfc3561"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"61","author":"G. Plotkin","year":"2004","unstructured":"Plotkin, G.: A structural approach to operational semantics. The Journal of Logic and Algebraic Programming 60-\u00a061, 17\u2013139 (2004) (originally appeared in 1981)","journal-title":"The Journal of Logic and Algebraic Programming 60-"},{"issue":"2-3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6423(95)00017-8","volume":"25","author":"K.V.S. Prasad","year":"1995","unstructured":"Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program.\u00a025(2-3), 285\u2013327 (1995)","journal-title":"Sci. Comput. Program."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"de Simone, R.: Higher-level synchronising devices in Meije-SCCS. Theor. Comput. Sci.\u00a037, 245\u2013267 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.scico.2009.07.008","volume":"75","author":"A. Singh","year":"2010","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. Science of Computer Programming\u00a075, 440\u2013469 (2010)","journal-title":"Science of Computer Programming"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Zhou, M., Yang, H., Zhang, X., Wang, J.: The proof of AODV loop freedom. In: Proc. IEEE WCSP (2009)","DOI":"10.1109\/WCSP.2009.5371479"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28869-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:54:23Z","timestamp":1556481263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28869-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288685","9783642288692"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28869-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}