Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-11-11
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
We establish a classification of decision problems that are to be solved by mobile agents operating in unlabeled graphs, using a deterministic protocol. The classification is with respect to the ability of a team of agents to solve the problem, possibly with the aid of additional information. In particular, our focus is on studying differences between the decidability of a decision problem by agents and its verifiability when a certificate for a positive answer is provided to the agents. We show that the class MAV of mobile agents verifiable problems is much wider than the class MAD of mobile agents decidable problems. Our main result shows that there exist natural MAV-complete problems: the most difficult problems in this class, to which all problems in MAV are reducible. Our construction of a MAV-complete problem involves two main ingredients in mobile agents computability: the topology of the quotient graph and the number of operating agents. Beyond the class MAV we show that, for a single agent, three natural oracles yield a strictly increasing chain of relative decidability classes.
Fraigniaud Pierre
Pelc Andrzej
No associations
LandOfFree
Decidability Classes for Mobile Agents Computing 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 Decidability Classes for Mobile Agents Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decidability Classes for Mobile Agents Computing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-431500