For k-synchronizable communicating automata, reachability checking and deciding whether a system is k-synchronizable are both decidable, with corrected mailbox proofs and new peer-to-peer results.
Formal Methods in System De - sign 52(3), 260–276 (2018)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.FL 1years
2019 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On the k-synchronizability of systems
For k-synchronizable communicating automata, reachability checking and deciding whether a system is k-synchronizable are both decidable, with corrected mailbox proofs and new peer-to-peer results.