Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
verfasst von : Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro
Erschienen in: Foundations of Software Science and Computational Structures
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We study decision problems for parameterized verification of protocols for ad hoc networks. The problem we consider is control state reachability for networks of arbitrary size. We restrict our analysis to topologies that approximate the notion of bounded diameter often used in ad hoc networks for optimizing broadcast communication. We show that restricting to graphs with bounded diameter is not sufficient to make control state reachability decidable, but the problem turns out to be decidable when considering an additionally restricted class of graphs that still includes cliques. Although decidable, the problem is already Ackermann-hard over clique graphs.