University of Cambridge > > Microsoft Research Cambridge, public talks > Multiparty Session Types Meet Communicating Automata

Multiparty Session Types Meet Communicating Automata

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This talk has been canceled/deleted

We extend Multiparty session types with expressive forking, merging and joining protocol constructs, while still ensuring properties such as communication safety, boundedness and liveness on distributed processes by type checking. We give a direct semantical connection to communicating finite state machines (CFSM) which allows us to identify a new class of CFS Ms that automatically enjoy the aforementioned properties, generalising Gouda et al’s work [GMY84] (for two machines) to an arbitrary number of machines.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity