On the power of cliques in the parameterized verification of ad hoc networks
From MaRDI portal
Publication:3000628
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
- On the complexity of parameterized reachability in reconfigurable broadcast networks
- Query-Based Model Checking of Ad Hoc Network Protocols
Cited in
(12)- scientific article; zbMATH DE number 7447739 (Why is no real title available?)
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Declarative parameterized verification of distributed protocols via the Cubicle model checker
- On the Verification of Timed Ad Hoc Networks
- Verification of parameterized communicating automata via split-width
- Parameterized verification of coverability in infinite state broadcast networks
- Parametric verification of a group membership algorithm
- Parameterized verification of ad hoc networks
- Parameterized Verification of Communicating Automata under Context Bounds
- Liveness in broadcast networks
- Parameterized verification of time-sensitive models of ad hoc network protocols
- Modeling and efficient verification of wireless ad hoc networks
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)