Efficient complementation for non commutation-closed global types beyond sender-driven choices

Develop concise and efficient complementation procedures for global types that are neither commutation-closed nor restricted to sender-driven choices, constructing complements with practical complexity bounds and without the doubly exponential blow-up observed in general constructions.

Background

The authors provide a linear-size complementation construction for sender-driven global types and a duality-based approach for commutation-closed types, while noting that generic complementation via product-and-duality may be doubly exponential.

They highlight the need for concise procedures that go beyond these restricted classes, particularly for non commutation-closed global types, to broaden the applicability of complementability in MPST.