Complete multiparty session type projection with automata

DOI10.1007/978-3-031-37709-9_17zbMATH Open1547.68506MaRDI QIDQ6535693FDOQ6535693

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

Publication date: 1 February 2024

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)

Cites Work

• Verification of programs with half-duplex communication
• Multiparty session types meet communicating automata
• Multiparty asynchronous session types
• On Communicating Finite-State Machines
• Multiparty compatibility in communicating automata: characterisation and synthesis of global session types
• Time, clocks, and the ordering of events in a distributed system
• Title not available (Why is that?)
• Realizability and verification of MSC graphs
• Context-Bounded Analysis of Concurrent Queue Systems
• On global types and multi-party sessions
• Multiparty session types, beyond duality
• A Gentle Introduction to Multiparty Asynchronous Session Types
• Analysis of a class of communicating finite state machines
• Title not available (Why is that?)
• Meeting Deadlines Together
• Parameterised multiparty session types
• Realizability of high-level message sequence charts: closing the gaps
• On the boundary between decidability and undecidability of asynchronous session subtyping
• On the Undecidability of Asynchronous Session Subtyping
• Title not available (Why is that?)
• Context-free session types
• Verifying asynchronous interactions via communicating session automata
• Session coalgebras: a coalgebraic view on session types and communication protocols
• Certifying data in multiparty session types
• Generalising Projection in Asynchronous Multiparty Session Types.
• Data Communicating Processes with Unreliable Channels
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• Title not available (Why is that?)
• Generalised multiparty session types with crash-stop failures
• Comparing the expressive power of the synchronous and asynchronous \(\pi\)-calculi

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)