Author of the publication

Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space.

, , , and . CoRR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Optimal Asynchronous Rendezvous for Mobile Robots with Lights., , and . CoRR, (2017)Corrigendum to Ön the approximability and hardness of minimum topic connected overlay and its special instances" Theoret. Comput. Sci. 429(2012) 144-154., , , , , and . Theor. Comput. Sci., (2015)Location functions for self-stabilizing byzantine tolerant swarms., , , , , and . Theor. Comput. Sci., (2023)Development of an Algorithm for Extracting Parallelism and Pipeline Structure from Stream-based Processing flow with Spanning Tree., , and . Int. J. Netw. Comput., 5 (1): 159-179 (2015)Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)., , , , and . CoRR, (2019)Special Section on Invited Papers from New Horizons in Computing.. IEICE Trans. Inf. Syst., 89-D (8): 2331 (2006)A pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axis., , , and . Syst. Comput. Jpn., 37 (10): 89-100 (2006)Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees., , , and . Syst. Comput. Jpn., 17 (3): 56-65 (1986)Performance evaluation of offloading software modules to cluster network., , , and . Parallel and Distributed Computing and Networks, page 51-56. IASTED/ACTA Press, (2007)Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs., , , and . WG, volume 1335 of Lecture Notes in Computer Science, page 354-367. Springer, (1997)