Multiparty Session Types Meet Communicating Automata

DOI10.1007/978-3-642-28869-2_10zbMath1352.68182OpenAlexW18866292MaRDI QIDQ2892728

Pierre-Malo Deniélou, Nobuko Yoshida

Publication date: 22 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-28869-2_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (37)

Relating two automata-based models of orchestration and choreography ⋮ Precise Subtyping for Asynchronous Multiparty Sessions ⋮ Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types ⋮ Substructural Proofs as Automata ⋮ Compliance in Behavioural Contracts: A Brief Survey ⋮ Automated verification of automata communicating via FIFO and bag buffers ⋮ On deciding synchronizability for asynchronously communicating systems ⋮ Orchestrated session compliance ⋮ Unnamed Item ⋮ Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python ⋮ Combining behavioural types with security analysis ⋮ An interface theory for service-oriented design ⋮ Multiparty half-duplex systems and synchronous communications ⋮ Event structure semantics for multiparty sessions ⋮ The different shades of infinite session types ⋮ Type theory based semantic verification for service composition in cloud computing environments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Paths to Choreography Extraction ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Lightening global types ⋮ An abstract framework for choreographic testing ⋮ Monitoring networks through multiparty session types ⋮ Global progress for dynamically interleaved multiparty sessions ⋮ Realisability of pomsets ⋮ Connecting open systems of communicating finite state machines ⋮ Unnamed Item ⋮ Global types with internal delegation ⋮ A calculus of branching processes ⋮ Unnamed Item ⋮ A Gentle Introduction to Multiparty Asynchronous Session Types ⋮ Enforcing Availability in Failure-Aware Communicating Systems ⋮ Unnamed Item ⋮ Concurrent Reversible Sessions ⋮ Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus

This page was built for publication: Multiparty Session Types Meet Communicating Automata