In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well-known that if the parties have predetermined roles, then the strategy where one of them waits at one vertex, while the other visits all n vertices in random order is optimal, taking at most n steps and averaging about n/2. Anderson an...

We address the problem of developing eecient cache coherence protocols implementing distributed shared memory (DSM) using message passing. A serious drawback of traditional approaches to this problem is that designers are required to state the desired coherence protocol at the level of asynchronous message interactions. We propose a method in which designers express the desired protocol at a hi...

In this paper, we propose a technique for hardware implementation of protocol specifications in LOTOS. For the purpose, we define a new model called synchronous EFSMs consisting of concurrent EFSMs and a finite set of multi-rendezvous indications among their subsets, and propose a conversion algorithm from a subset of LOTOS. The derived synchronous EFSMs can be easily implemented as a synchrono...

In WSN, data aggregation is an important process for reducing the energy consumption. We can reduce energy consumption by using the efficient technique for data aggregation. Also, achieving the reliability and robustness of transferring data is one of the major issues and challenges. in order to produce both reliability and energy efficiency, in this paper we propose to design a Mobile Sink for...

The topic of autonomous close-range rendezvous is discussed in this paper. When designing a controller for an autonomous system, it is important to model the environment of the system as precisely as possible. This paper discusses the disturbances encountered in space and their effects on the rendezvous controller with particular focus on the effects in fuel usage and mission times. Simulations...

The algorithms onboard Unmanned Aerial Vehicles are increasing in complexity and thus require a well established concept to flight test development process to accelerate deployment and avoid loss of aircraft. We present a modular multi-UAV algorithm development framework which combines design, simulation, performance evaluation and deployment in a single, high level graphical environment. The f...

We address the problem of developing efficient cache coherence protocols implementing distributed shared memory (DSM) using message passing. A serious drawback of traditional approaches to this problem is that designers are required to state the desired coherence protocol at the level of asynchronous message interactions. We propose a method in which designers express the desired protocol at a ...

In this paper, we present an approach to refine the communication mechanism of CFSMs. Currently, CFSMs communicate via one-place buffer using nonblocking write semantics. If sending events arrive faster than the receiving module can consume, some events may be lost. This is clearly undesirable especially when the events are critical. Using a rendezvous-based mechanism for communication as our s...

The optimal fuel impulsive time-fixed rendezvous problem is reviewed. In a linear setting, it may be reformulated as a non convex polynomial optimization problem for a pre-specified fixed number of velocity increments. Relying on variational results previously published in the literature, an improved mixed iterative algorithm is defined to address the issue of optimization over the number of im...