The cost of parameterized reachability in mobile ad hoc networks
arXiv preprint arXiv:1202.5850, 2012•arxiv.org
We investigate the impact of spontaneous movement in the complexity of verification
problems for an automata-based protocol model of networks with selective broadcast
communication. We first consider reachability of an error state and show that parameterized
verification is decidable with polynomial complexity. We then move to richer queries and
show how the complexity changes when considering properties with negation or cardinality
constraints.
problems for an automata-based protocol model of networks with selective broadcast
communication. We first consider reachability of an error state and show that parameterized
verification is decidable with polynomial complexity. We then move to richer queries and
show how the complexity changes when considering properties with negation or cardinality
constraints.
We investigate the impact of spontaneous movement in the complexity of verification problems for an automata-based protocol model of networks with selective broadcast communication. We first consider reachability of an error state and show that parameterized verification is decidable with polynomial complexity. We then move to richer queries and show how the complexity changes when considering properties with negation or cardinality constraints.
arxiv.org
Showing the best result for this search. See all results