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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
