FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...