The Cost of Parameterized Reachability in Mobile Ad Hoc Networks

Details The Cost of Parameterized Reachability in Mobile Ad Hoc Networks The Cost of Parameterized Reachability in Mobile Ad Hoc Networks

2012-02-27

arxiv.org/abs/1202.5850v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Cost of Parameterized Reachability in Mobile Ad Hoc Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Cost of Parameterized Reachability in Mobile Ad Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Cost of Parameterized Reachability in Mobile Ad Hoc Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262952