Multiparty compatibility in communicating automata: characterisation and synthesis of global session types

Authors:
Pierre-Malo Deniélou;Nobuko Yoshida
Affiliations:
Royal Holloway, University of London, UK;Imperial College London, UK
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Year:
2013

Citing 16
Cited 0

On the progress of communication between two finite state machines

Information and Control
Linear logic

Theoretical Computer Science
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Language Primitives and Type Discipline for Structured Communication-Based Programming

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
An Interaction-based Language and its Typing System

PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Multiparty asynchronous session types

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Global Progress in Dynamically Interleaved Multiparty Sessions

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Global Principal Typing in Partially Commutative Asynchronous Sessions

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Verification of programs with half-duplex communication

Information and Computation
Session types as intuitionistic linear propositions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Dynamic multirole session types

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding choreography realizability

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of communicating automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Multiparty session types meet communicating automata

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Propositions as sessions

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Synthesising choreographies from local session types

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiparty session types are a type system that can ensure the safety and liveness of distributed peers via the global specification of their interactions. To construct a global specification from a set of distributed uncontrolled behaviours, this paper explores the problem of fully characterising multiparty session types in terms of communicating automata. We equip global and local session types with labelled transition systems (LTSs) that faithfully represent asynchronous communications through unbounded buffered channels. Using the equivalence between the two LTSs, we identify a class of communicating automata that exactly correspond to the projected local types. We exhibit an algorithm to synthesise a global type from a collection of communicating automata. The key property of our findings is the notion of multiparty compatibility which non-trivially extends the duality condition for binary session types.