Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies. In this paper, we attempt to develop a theory of broadcast networks in which the processes can be well-structured transition systems. The resulting formalism is called well-structured broadcast networks. For various types of communication topologies, we prove the decidability of coverability in the static case, i.e., when the network topology is not allowed to change. We do this by showing that for these types of static communication topologies, the broadcast network itself is a well-structured transition system, hence proving the decidability of coverability in the broadcast network. We also give an algorithm to decide coverability of well-structured broadcast networks when reconfiguration of links between nodes is allowed. Finally, with minor modifications of this algorithm we prove decidability of coverability when the underlying process is a pushdown automaton.

对于不同类型的模型和拓扑，已经研究了具有有限状态过程的广播网络中的可覆盖性的参数化验证。在本文中，我们尝试发展一种广播网络的理论，其中的过程可以是结构良好的过渡系统。由此产生的形式主义被称为结构良好的广播网络。对于各种类型的通信拓扑，我们证明了在静态情况下（即当不允许更改网络拓扑时）可覆盖性的可确定性。我们通过显示对于这些类型的静态通信拓扑来做到这一点，广播网络本身是一个结构良好的过渡系统，因此证明了广播网络中可覆盖性的可判定性。当允许重新配置节点之间的链接时，我们还提供了一种算法来决定结构合理的广播网络的可覆盖性。最后，通过对该算法进行较小的修改，当基础过程是下推式自动机时，我们证明了可覆盖性的可确定性。