Dynamics and Coherence for the Free Cornering with Protocol Choice
This work addresses theoretical foundations for process interaction modeling, but it appears incremental as it builds on existing categorical frameworks without clear practical applications.
The authors tackled the problem of modeling dynamic aspects of free cornering with protocol choice in monoidal categories, a categorical model for process interaction, by developing a term rewriting system that is confluent and terminating, and used it to prove a coherence theorem.
We present a term rewriting system that models the dynamic aspects of the free cornering with protocol choice of a monoidal category, which has been proposed as a categorical model of process interaction. This term rewriting system is confluent and terminating in an appropriate sense. We use this machinery to prove a coherence theorem for the free cornering with protocol choice.