{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:05:18Z","timestamp":1725584718628},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642210693"},{"type":"electronic","value":"9783642210709"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21070-9_17","type":"book-chapter","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T00:02:27Z","timestamp":1307404947000},"page":"212-229","source":"Crossref","is-referenced-by-count":1,"title":["Towards an Algebra of Routing Tables"],"prefix":"10.1007","author":[{"given":"Peter","family":"H\u00f6fner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annabelle","family":"McIver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"AODV-UU: An implementation of the AODV routing protocol (IETF RFC 3561), http:\/\/sourceforge.net\/projects\/aodvuu\/ (accessed February 26, 2011)"},{"key":"17_CR2","unstructured":"Backhouse, R.: Closure Algorithms and the Star-Height Problem of Regular Languages. Ph.D. thesis, Imperial College, London (1975)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Backhouse, R., Carr\u00e9, B.A.: Regular algebra applied to path-finding problems. Journal of the Institute of Mathematics and Applications (1975)","DOI":"10.1093\/imamat\/15.2.161"},{"key":"17_CR4","series-title":"Oxford Applied Mathematics & Computing Science Series","volume-title":"Graphs and Networks","author":"B.A. Carr\u00e9","year":"1980","unstructured":"Carr\u00e9, B.A.: Graphs and Networks. Oxford Applied Mathematics & Computing Science Series. Oxford University Press, Oxford (1980)"},{"key":"17_CR5","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Boca Raton (1971)"},{"key":"17_CR6","first-page":"93","volume":"1","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Modal Kleene algebra and applications \u2014 A survey. Journal of Relational Methods in Computer Science\u00a01, 93\u2013131 (2004)","journal-title":"Journal of Relational Methods in Computer Science"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"17_CR8","first-page":"173","volume":"65","author":"T. Fernandes","year":"2007","unstructured":"Fernandes, T., Desharnais, J.: Describing data flow analysis techniques with Kleene algebra. SCP\u00a065, 173\u2013194 (2007)","journal-title":"SCP"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-78913-0_11","volume-title":"Relations and Kleene Algebra in Computer Science","author":"T.G. Griffin","year":"2008","unstructured":"Griffin, T.G., Gurney, A.J.T.: Increasing bisemigroups and algebraic routing. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS\/AKA 2008. LNCS, vol.\u00a04988, pp. 123\u2013137. Springer, Heidelberg (2008)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1090191.1080094","volume":"35","author":"T.G. Griffin","year":"2005","unstructured":"Griffin, T.G., Sobrinho, J.: Metarouting. SIGCOMM Comp. Com. Rev.\u00a035, 1\u201312 (2005)","journal-title":"SIGCOMM Comp. Com.. Rev."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-04081-8_27","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C.A.R. Hoare","year":"2009","unstructured":"Hoare, C.A.R., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 399\u2013414. Springer, Heidelberg (2009)"},{"key":"17_CR12","unstructured":"H\u00f6fner, P.: Database for automated proofs of Kleene algebra, http:\/\/www.kleenealgebra.de (accessed February 26, 2011)"},{"key":"17_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73595-3_19","volume-title":"Automated Deduction \u2013 CADE-21","author":"P. H\u00f6fner","year":"2007","unstructured":"H\u00f6fner, P., Struth, G.: Automated reasoning in kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 279\u2013294. Springer, Heidelberg (2007)"},{"key":"17_CR14","volume-title":"The Design and Analysis of Algorithms","author":"D. Kozen","year":"1991","unstructured":"Kozen, D.: The Design and Analysis of Algorithms. Springer, Heidelberg (1991)"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110(2), 366\u2013390 (1994)","journal-title":"Information and Computation"},{"key":"17_CR16","unstructured":"McCune, W.W.: Prover9 and Mace4, http:\/\/www.cs.unm.edu\/~mccune\/prover9 (accessed February 26, 2011)"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.jlap.2007.10.005","volume":"76","author":"A.K. McIver","year":"2008","unstructured":"McIver, A.K., Gonzalia, C., Cohen, E., Morgan, C.C.: Using probabilistic Kleene algebra pKA for protocol verification. J. Logic and Algebraic Programming\u00a076(1), 90\u2013111 (2008)","journal-title":"J. Logic and Algebraic Programming"},{"key":"17_CR18","unstructured":"M\u00f6ller, B.: Dijkstra, Kleene, Knuth. Talk at WG2.1 Meeting, slides available online, at http:\/\/web.comlab.ox.ac.uk\/jeremy.gibbons\/wg21\/meeting61\/MoellerDijkstra.pdf (accessed February 26, 2006)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11734673_16","volume-title":"Relational Methods in Computer Science","author":"B. M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., Struth, G.: WP is WLP. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 200\u2013211. Springer, Heidelberg (2006)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Perkins, C., Belding-Royer, E., Das, S.: Ad hoc on-demand distance vector (AODV) routing. RFC 3561 (Experimental) (July 2003), http:\/\/www.ietf.org\/rfc\/rfc3561.txt","DOI":"10.17487\/rfc3561"},{"key":"17_CR21","first-page":"440","volume":"75","author":"A. Singh","year":"2010","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. SCP\u00a075, 440\u2013469 (2010)","journal-title":"SCP"},{"issue":"4","key":"17_CR22","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TNET.2002.801397","volume":"10","author":"J. Sobrinho","year":"2002","unstructured":"Sobrinho, J.: Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. IEEE\/ACM Trans. Networking\u00a010(4), 541\u2013550 (2002)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"17_CR23","series-title":"SIGCOMM 2003","first-page":"49","volume-title":"Applications, Technologies, Architectures, and Protocols for Computer Communications","author":"J. Sobrinho","year":"2003","unstructured":"Sobrinho, J.: Network routing with path vector protocols: Theory and applications. In: Applications, Technologies, Architectures, and Protocols for Computer Communications. SIGCOMM 2003, pp. 49\u201360. ACM Press, New York (2003)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Takai, T., Furusawa, H.: Monodic tree kleene algebra. In: Schmidt, R.A. (ed.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 402\u2013416. Springer, Heidelberg (2006) (accessed February 26, 2011) Errata available at http:\/\/www.sci.kagoshima-u.ac.jp\/~furusawa\/person\/Papers\/correct_ monodic_kleene_algebra.pdf","DOI":"10.1007\/11828563_27"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21070-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T09:07:37Z","timestamp":1560244057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21070-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210693","9783642210709"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21070-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}