{"id":3274,"date":"2018-07-01T12:05:06","date_gmt":"2018-07-01T03:05:06","guid":{"rendered":"https:\/\/cs.kyushu-u.ac.jp\/sicorp-in\/?p=3274"},"modified":"2020-12-25T09:05:51","modified_gmt":"2020-12-25T00:05:51","slug":"prof-prasad-lecture","status":"publish","type":"post","link":"https:\/\/cs.kyushu-u.ac.jp\/sicorp-in\/2018\/07\/01\/prof-prasad-lecture\/","title":{"rendered":"Prof.Sanjiva Prasad has visited Kyushu Univ. from IITD in India to have lectures about Formal Foundations of Routing in Networks"},"content":{"rendered":"

The prof.Sanjiva Prasad <\/span>has visited Kyushu university on July 1st, 2018 from IITD for 10 days, and had some valuable lectures of Formal Foundations of Routing in Networks to the students here. Also we had meetings on each WP. It was so productive time each other.<\/span><\/p>\n

\"\" \"\"<\/p>\n

Prof.Sanjiva Prasad<\/span><\/strong><\/em><\/span><\/a><\/p><\/blockquote>\n

Title: Formal Foundations of Routing in Networks (3 lectures)<\/span>
\nJuly 4th at West 2 building room no.725, Kyushu Univ.<\/span>
\nJuly 9th-10th at West 2 building, room no.826,Kyushu Univ.<\/span><\/span>
\nSpeaker: Prof. Sanjiva Prasad, Indian Institute of Technology Delhi.<\/span><\/p>\n

Title<\/span> :<\/span>Formal Foundations of Routing in Networks 2018 Lecture<\/strong><\/em>s\u00a0<\/strong><\/em>4-9 July 2018<\/span><\/strong><\/em><\/span><\/a><\/p>\n

Title<\/span> :<\/span>Formal Foundations of Routing in Networks Kyushu University Lectures\u00a04-10 July 2018<\/strong><\/em><\/span><\/a><\/p>\n

Abstracts:<\/span>
\nAlgebraic structures such as semirings have long provided the mathematical basis for framing path-related questions such as connectivity and least-cost paths in communication networks. The presentation will be self-contained in giving a gentle introduction to the necessary algebraic concepts, and the generalisation of simple algorithms.<\/span><\/p>\n

A long series of work starting from Berge and Carre\u2019 up to recent work by Hoefner & Moeller show that algorithmic solutions to these problems, such as those given by Dijkstra and by Roy\/Floyd\/Warshall, can be algebraically derived within a framework of cost semirings.<\/span><\/p>\n

Packet-switching networks additionally require being able to define filters and describe complex sets of paths. The theory of Kleene Algebras with Tests, specialised for networks yields a domain-specific algebraic language (NetKAT of Foster, Kozen, Silva et al.) in which reachability properties of packet switching networks can be expressed and proved (using co-algebraic techniques).<\/span><\/p>\n

Short movie for lecture by Prof.Prasad<\/span><\/p>\n