@inproceedings{6bef6012df3c45088b70a229446bb303,
title = "The MSO theory of connectedly communicating processes",
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 if the process p executes k steps without hearing from process q - directly or indirectly - then it will never hear from q again. The non-interleaved branching time behavior of a system of connectedly communicating processes (CCP) is given by its event structure unfolding. We show that the monadic second order (MSO) theory of the event structure unfolding of every CCP is decidable. Using this result, we also show that an associated distributed controller synthesis problem is decidable for linear time specifications that do not discriminate between two different linearizations of the same partially ordered execution.",
author = "P. Madhusudan and Thiagarajan, {P. S.} and Shaofa Yang",
year = "2005",
doi = "10.1007/11590156_16",
language = "English (US)",
isbn = "3540304959",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "201--212",
booktitle = "FSTTCS 2005",
note = "25th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005 ; Conference date: 15-12-2005 Through 18-12-2005",
}