Decidability classes for mobile agents computing
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(9)- On mobile agent verifiable problems
- Verification of agent navigation in partially-known environments
- Distinguishing views in symmetric networks: a tight lower bound
- On mobile agent verifiable problems
- Setting ports in an anonymous network: how to reduce the level of symmetry?
- Deciding reachability problems in Turing-complete fragments of Mobile Ambients
- Redundancy in distributed proofs
- Distributed verification using mobile agents
- Gathering despite mischief
This page was built for publication: Decidability classes for mobile agents computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894480)
