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. Our main result shows that there exists a natural complete problem for mobile agent verification. We also show that, for a single agent, three natural oracles yield a strictly increasing chain of relative decidability classes. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Fraigniaud, P., & Pelc, A. (2012). Decidability classes for mobile agents computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7256 LNCS, pp. 362–374). https://doi.org/10.1007/978-3-642-29344-3_31
Mendeley helps you to discover research relevant for your work.