Communicating finite state machines and an extensible toolchain for multiparty session types

DOI10.1007/978-3-030-86593-1_2zbMath1487.68168OpenAlexW3199431963MaRDI QIDQ2140476

Francisco Ferreira, Nobuko Yoshida, Fangyi Zhou

Publication date: 20 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_2

zbMATH Keywords

session typesprotocolsdistributed programmingcommunicating finite state machinesScribble

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Research Challenges in Orchestration Synthesis

Uses Software

• Scribble
• Zooid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python
• Precise subtyping for synchronous multiparty sessions
• From Communicating Machines to Graphical Choreographies
• Nested Protocols in Session Types
• Multiparty Asynchronous Session Types
• Multiparty asynchronous session types
• On Communicating Finite-State Machines
• Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
• Verifying asynchronous interactions via communicating session automata
• Featherweight Scribble

This page was built for publication: Communicating finite state machines and an extensible toolchain for multiparty session types