Parameterized Verification of Coverability in Well-Structured Broadcast Networks

A.R. Balasubramanian
(Chennai Mathematical Institute)

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. We give an algorithm to decide coverability of well-structured broadcast networks when reconfiguration of links between nodes is allowed. Further, for various types of communication topologies, we also prove the decidability of coverability in the static case as well. 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.

In Andrea Orlandini and Martin Zimmermann: Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2018), Saarbrücken, Germany, 26-28th September 2018, Electronic Proceedings in Theoretical Computer Science 277, pp. 133–146.
Published: 7th September 2018.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: