Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types

DOI10.1007/978-3-642-39212-2_18zbMath1334.68149arXiv1304.1902OpenAlexW2119992090MaRDI QIDQ5327432

Nobuko Yoshida, Pierre-Malo Deniélou

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.1902

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Multiparty session types as coherence proofs, Contracts as games on event structures, Precise Subtyping for Asynchronous Multiparty Sessions, Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types, Communicating finite state machines and an extensible toolchain for multiparty session types, Behavioural Analysis of Sessions Using the Calculus of Structures, Compliance in Behavioural Contracts: A Brief Survey, Multiparty session types, beyond duality, Verifiable abstractions for contract-oriented systems, Unnamed Item, Timed runtime monitoring for multiparty conversations, A predicate transformer for choreographies. Computing preconditions in choreographic programming, Unnamed Item, Honesty by Typing, Unnamed Item, On the Undecidability of Asynchronous Session Subtyping, A Sound Algorithm for Asynchronous Session Subtyping, Fair refinement for asynchronous session types, Session coalgebras: a coalgebraic view on session types and communication protocols, An abstract framework for choreographic testing, A core model for choreographic programming, Global progress for dynamically interleaved multiparty sessions, Unnamed Item, Global types with internal delegation, Automata for Analysing Service Contracts, A Gentle Introduction to Multiparty Asynchronous Session Types, Multiparty Session Types Within a Canonical Binary Theory, and Beyond, Constructing weak simulations from linear implications for processes with private names, Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus, Prioritise the best variation