Guessing the Buffer Bound for k-Synchronizability

Abstract

A communicating system is [Formula: see text]-synchronizable if all of the message sequence charts representing the executions can be divided into slices of [Formula: see text] sends followed by [Formula: see text] receptions. It was previously shown that, for a fixed given [Formula: see text], one could decide whether a communicating system is [Formula: see text]-synchronizable. This result is interesting because the reachability problem can be solved for [Formula: see text]-synchronizable systems. However, the decision procedure assumes that the bound [Formula: see text] is fixed. In this paper we improve this result and show, for mailbox communication, that it is possible to decide if such a bound [Formula: see text] exists.