Cover Image

Deciding Subtyping for Asynchronous Multiparty Sessions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Elaine, Stutz, Felix, Wies, Thomas
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complete Multiparty Session Type Projection with Automata
by: Li, Elaine, et al.
Published: (2023)

Characterizing Implementability of Global Protocols with Infinite States and Data
by: Li, Elaine, et al.
Published: (2024)

An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols
by: Stutz, Felix, et al.
Published: (2025)

Realisability and Complementability of Multiparty Session Types
by: Di Giusto, Cinzia, et al.
Published: (2025)

Global Protocols under Rendezvous Synchrony: From Realizability to Type Checking
by: Li, Elaine, et al.
Published: (2026)

Implementability of Global Distributed Protocols modulo Network Architectures
by: Li, Elaine, et al.
Published: (2026)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

Mixed Choice in Asynchronous Multiparty Session Types
by: Bocchi, Laura, et al.
Published: (2026)

On Decidability Timed Automata with 2 Parametric Clocks
by: Bersani, Marcello M., et al.
Published: (2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

Asynchronism in Cellular Automata
by: Gautam, Virendra Kumar
Published: (2025)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)

Adding Reconfiguration to Zielonka's Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2023)

Synthesising Asynchronous Automata from Fair Specifications
by: Bérard, Béatrice, et al.
Published: (2025)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2026)

A Session Type System for Asynchronous Unreliable Broadcast Communication
by: Kouzapas, Dimitrios, et al.
Published: (2019)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

Decidable problems in substitution shifts
by: Béal, Marie-Pierre, et al.
Published: (2021)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
by: Roop, Partha, et al.
Published: (2026)

New Insights into the Decidability of Opacity in Timed Automata
by: Deng, Weilin, et al.
Published: (2025)

Decidability and Characterization of Expansivity for Group Cellular Automata
by: Castronuovo, Niccolo', et al.
Published: (2025)

A Divide and Conquer Algorithm for Deciding Group Cellular Automata Dynamics
by: Castronuovo, Niccolo', et al.
Published: (2025)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

Deciding Conjugacy of a Rational Relation
by: Aiswarya, C., et al.
Published: (2023)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

Characterization and Decidability of FC-Definable Regular Languages
by: Thompson, Sam M., et al.
Published: (2025)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

Navigational hierarchies of regular languages
by: Place, Thomas, et al.
Published: (2024)

Dot-depth three, return of the J-class
by: Place, Thomas, et al.
Published: (2024)

All about unambiguous polynomial closure
by: Place, Thomas, et al.
Published: (2022)

A Simple Trace Semantics for Asynchronous Sequence Diagrams
by: Faitelson, David, et al.
Published: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
by: Ibarra, Oscar H., et al.
Published: (2024)

Deciding the synthesis problem for hybrid games through bisimulation
by: Dima, Catalin, et al.
Published: (2024)

Cost Automata, Safe Schemes, and Downward Closures
by: Barozzini, David, et al.
Published: (2020)

Do CFLOBDDs Actually Make Use of Linear Structure?
by: Sistla, Meghana Aparna, et al.
Published: (2026)