|[1-11]Multiparty session types and Multiparty Session Automata|
Title: Multiparty session types and Multiparty Session Automata
Speaker: Dr. Pierre-Malo Deniélou (Imperial College London, UK)
Time: 3:00pm, January 11th (Wednesday), 2012.
Venue: Lecture Room, Level 3, Building No. 5, State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Science.
In this talk, I will introduce Multiparty Session Types, a type discipline for the pi-calculus which extends binary session type theory to multiparty communication. I will then present some recent results about a connection between Multiparty Session Types and communicating automata. This connection defines a new class of automata, that we call Multiparty Session Automata (MSA). MSA enjoy several good properties, such as freedom from deadlock and communication error, and buffer boundedness, while still being polynomial.
Joint work with Nobuko Yoshida