This paper revisits the widely researched gathering problem for two robots without any agreement on coordinate system in a scenario which allows randomization asynchronous scheduling model. The scheduler is considered to be adversary determines activation schedule of robots. comes three flavors, namely, adaptive offline, online, and oblivious, based knowledge outcome random bits. follow wait-lo...

Consider a set of k identical asynchronous mobile agents located in an anonymous ring n nodes. The classical Gather (or Rendezvous) problem requires all to meet at the same node, not priori decided, within finite amount time. This has been studied assuming that network is safe for agents. In this paper, we consider presence stationary process node disables any incoming agent without leaving tra...

This paper discusses the current shortfalls in support for the pre-coding phases of a discrete event simulation project. The paper then presents a process modelling technique, Simulation Activity Diagrams (SADs), developed to specifically support the initial requirements gathering phases of a simulation project. The paper concludes with an outline of proposed future developments to the modellin...