On mobile agent verifiable problems

DOI10.1016/J.IC.2018.03.003MaRDI QIDQ1753994zbMATH OpenOpenAlexWikidataFDO

Authors Evangelos Bampas, David Ilcinkas

Publication date 30 May 2018

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2018.03.003

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed systems (68M14)

Recommendations

• On mobile agent verifiable problems
• Distributed verification using mobile agents
• Expressing and verifying temporal and structural properties of mobile agents
• Decidability classes for mobile agents computing
• scientific article; zbMATH DE number 2087391
• scientific article; zbMATH DE number 2084804
• An Algorithmic Theory of Mobile Agents

Cites work

• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• About the Termination Detection in the Asynchronous Message Passing Model
• An annotated bibliography on guaranteed graph searching
• Anonymous networks
• Computing functions on asynchronous anonymous networks
• Distributed chasing of network intruders
• Distributed verification and hardness of distributed approximation
• Distributed verification using mobile agents
• Identifying hostile nodes in networks using mobile agents
• Local Terminations and Distributed Computability in Anonymous Networks
• Locality and checkability in wait-free computing
• Locally checkable proofs in distributed computing
• Mobile agents in distributed computing: network exploration
• On the Impact of Identifiers on Local Decision
• Proof labeling schemes
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• Survey of distributed decision
• Towards a complexity theory for local distributed computing
• Tree exploration with logarithmic memory
• Universal dynamic synchronous self-stabilization
• Unreliable failure detectors for reliable distributed systems
• What Can be Computed Locally?
• What can be decided locally without identifiers?

Cited in

(5)

• On mobile agent verifiable problems
• Decidability classes for mobile agents computing
• Distributed verification using mobile agents
• Verification of agent navigation in partially-known environments
• Deciding reachability problems in Turing-complete fragments of Mobile Ambients

This page was built for publication: On mobile agent verifiable problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753994)