2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.PL2024★ 1 cited
Characterizing Implementability of Global Protocols with Infinite States and Data
Elaine Li, Felix Stutz, Thomas Wies +1
We study the implementability problem for an expressive class of symbolic communication protocols involving multiple participants. Our symbolic protocols describe infinite states a…
cs.FL2024★ 2 cited
Deciding Subtyping for Asynchronous Multiparty Sessions
Elaine Li, Felix Stutz, Thomas Wies
Multiparty session types (MSTs) are a type-based approach to verifying communication protocols, represented as global types in the framework. We present a precise subtyping relatio…
cs.FL2022★ 1 cited
Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types
Felix Stutz, Damien Zufferey
Communicating state machines provide a formal foundation for distributed computation. Unfortunately, they are Turing-complete and, thus, challenging to analyse. In this paper, we c…