The Cost of Parameterized Reachability in Mobile Ad Hoc Networks
classification
💻 cs.LO
keywords
complexitynetworksparameterizedreachabilityverificationautomata-basedbroadcastcardinality
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.