On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
From MaRDI portal
Publication:3000628
DOI10.1007/978-3-642-19805-2_30zbMath1326.68040OpenAlexW2149493230MaRDI QIDQ3000628
Gianluigi Zavattaro, Arnaud Sangnier, Giorgio Delzanno
Publication date: 19 May 2011
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_30
Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network protocols (68M12)
Related Items
Parameterized Verification of Communicating Automata under Context Bounds, On the Verification of Timed Ad Hoc Networks, Liveness in broadcast networks, Modeling and efficient verification of wireless ad hoc networks, Parameterized verification of time-sensitive models of ad hoc network protocols, Unnamed Item, Multiset rewriting for the verification of depth-bounded processes with name binding, Parameterized verification of coverability in infinite state broadcast networks, Verification of Parameterized Communicating Automata via Split-Width, Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker
