On the power of cliques in the parameterized verification of ad hoc networks

DOI10.1007/978-3-642-19805-2_30zbMATH Open1326.68040OpenAlexW2149493230MaRDI QIDQ3000628FDOQ3000628

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Cited In (10)

• Title not available (Why is that?)
• Multiset rewriting for the verification of depth-bounded processes with name binding
• On the Verification of Timed Ad Hoc Networks
• Parameterized verification of coverability in infinite state broadcast networks
• Parameterized Verification of Communicating Automata under Context Bounds
• Liveness in broadcast networks
• Verification of Parameterized Communicating Automata via Split-Width
• Parameterized verification of time-sensitive models of ad hoc network protocols
• Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker
• Modeling and efficient verification of wireless ad hoc networks

   Recommendations

• Parameterized verification of ad hoc networks 👍 👎
• Parameterized verification of time-sensitive models of ad hoc network protocols 👍 👎
• On the Verification of Timed Ad Hoc Networks 👍 👎
• Title not available (Why is that?) 👍 👎
• Query-Based Model Checking of Ad Hoc Network Protocols 👍 👎

This page was built for publication: On the power of cliques in the parameterized verification of ad hoc networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000628)