Complete multiparty session type projection with automata

DOI10.1007/978-3-031-37709-9_17MaRDI QIDQ6535693zbMATH OpenFDO

Authors Elaine Li, Felix Stutz, Thomas Wies, Damien Zufferey

Publication date 1 February 2024

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

deadlock freedomprotocol verificationcommunicating state machinesmultiparty session typesprotocol fidelity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
• Communicating finite state machines and an extensible toolchain for multiparty session types
• Multiparty session types, beyond duality
• Exploring type-level bisimilarity towards more expressive multiparty session types
• Certifying data in multiparty session types

Cites work

• scientific article; zbMATH DE number 5286864 (Why is no real title available?)
• scientific article; zbMATH DE number 2209335 (Why is no real title available?)
• A gentle introduction to multiparty asynchronous session types
• Analysis of a class of communicating finite state machines
• Certifying data in multiparty session types
• Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
• Comparing the expressive power of the synchronous and asynchronous \(\pi\)-calculi
• Context-Bounded Analysis of Concurrent Queue Systems
• Context-free session types
• Data communicating processes with unreliable channels
• Generalised multiparty session types with crash-stop failures
• Generalising Projection in Asynchronous Multiparty Session Types.
• Meeting deadlines together
• Multiparty asynchronous session types
• Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
• Multiparty session types meet communicating automata
• Multiparty session types, beyond duality
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• On Communicating Finite-State Machines
• On global types and multi-party sessions
• On the boundary between decidability and undecidability of asynchronous session subtyping
• On the preciseness of subtyping in session types
• On the undecidability of asynchronous session subtyping
• Parameterised multiparty session types
• Realizability and verification of MSC graphs
• Realizability of high-level message sequence charts: closing the gaps
• Session coalgebras: a coalgebraic view on session types and communication protocols
• Time, clocks, and the ordering of events in a distributed system
• Verification of programs with half-duplex communication
• Verifying asynchronous interactions via communicating session automata

This page was built for publication: Complete multiparty session type projection with automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535693)