Back to Search
Start Over
Guessing the buffer bound for k-synchronizability
- Publication Year :
- 2021
-
Abstract
- 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. It was previously shown that, for a fixed given $k$, one could decide whether a communicating system is $k$-synchronizable. This result is interesting because the reachability problem can be solved for $k$-synchronizable systems. However, the decision procedure assumes that the bound $k$ is fixed. In this paper we improve this result and show that it is possible to decide if such a bound $k$ exists.<br />Comment: Long version of CIAA paper (19 pages)
- Subjects :
- Computer Science - Formal Languages and Automata Theory
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2104.14408
- Document Type :
- Working Paper