A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs

No abstract is available for this paper.

• Publication year

  2018

• Venue

  International Conference of Distributed Computing and Networking

• Publication date

  2018-01-04

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/3154273.3154321
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parameterized verification of algorithms for oblivious robots on a ring

  2017cited by this paper
• Formal verification of mobile robot protocols

  2016cited by this paper
• Model Checking of a Mobile Robots Perpetual Exploration Algorithm

  2016cited by this paper
• Synchronous Gathering without Multiplicity Detection: a Certified Algorithm

  2016cited by this paper
• Brief Announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots

  2016cited by this paper
• A unified approach for gathering and exclusive searching on rings under weak assumptions

  2016cited by this paper
• Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks

  2015cited by this paper
• Optimal torus exploration by oblivious robots

  2015cited by this paper
• Formal Methods for Mobile Robots: Current Results and Open Problems

  2015cited by this paper
• Verification of Asynchronous Mobile-Robots in Partially-Known Environments

  2015cited by this paper
• On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering

  2014cited by this paper
• Impossibility of gathering, a certification

  2014cited by this paper
• Exclusive Graph Searching

  2013cited by this paper
• Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

  2013cited by this paper
• Distributed Computing by Oblivious Mobile Robots

  2012cited by this paper
• Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection

  2012cited by this paper
• Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols

  2012cited by this paper
• Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction

  2011cited by this paper
• Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection

  2011cited by this paper
• Optimal Grid Exploration by Asynchronous Oblivious Robots

  2011cited by this paper
• Network Exploration by Silent and Oblivious Robots

  2010cited by this paper
• Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings

  2010cited by this paper
• Exclusive Perpetual Ring Exploration without Chirality

  2010cited by this paper
• Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots

  2009cited by this paper
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots

  2009cited by this paper
• Certifying Distributed Algorithms by Embedding Local Computation Systems in the Coq Proof Assistant

  2009cited by this paper
• Anonymous graph exploration without collision by mobile robots

  2008cited by this paper
• Remembering without memory: Tree exploration by asynchronous oblivious robots

  2008cited by this paper
• Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

  2007cited by this paper
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

  1999cited by this paper
• Inductively defined types

  1988cited by this paper

• Swarms of Mobile Robots: Towards Versatility with Safety

  2022cites this paper
• Unreliable Sensors for Reliable Efficient Robots

  2021cites this paper
• Computer Aided Formal Design of Swarm Robotics Algorithms

  2021cites this paper
• Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots

  2020cites this paper
• Oblivious Robots on Graphs: Exploration

  2019cites this paper
• Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space

  2019cites this paper
• Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots

  2019influential citation
• On the encoding and solving partial information games

  2019cites this paper
• Formal Methods for Mobile Robots

  2019cites this paper
• On the Encoding and Solving of Partial Information Games

  2018cites this paper
• Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots

  2018cites this paper
• Synchronous Gathering without Multiplicity Detection: a Certified Algorithm

  2016cites this paper