Guessing the buffer bound for k-synchronizability

Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes

A communicating system is $k$-synchronizable if all of the message sequence charts representing the executions can be divided into slices of $k$ sends followed by $k$ receptions. I…