Copenhagen Programming Language Seminar
We suggest a Calculus for Mobile Ad Hoc Networks, CMAN. A node in a network is a process equipped with a location, it may communicate with other nodes using synchronous spatially oriented broadcast where only the current neighbors receive the message. Nodes may autonomously change their neighbor relationship and thereby change the network topology. We define a natural reduction semantics and a reduction congruence as well as a labeled transition semantics and prove a weak contextual bisimulation to be a sound and complete co-inductive characterizations of the reduction congruence. Finally, we apply CMAN on a small example of a cryptographic routing protocol.
This is a lunch meeting (there is no lunch provided but you are welcome to bring your own lunch).
Scientific host: Andrezej Wasowski . Administrative host: Annette
Enggaard . All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU, KVL and RUC.
COPLAS is sponsored by the FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to email@example.com with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org