With a great deal of different applications increasing, it needs to provide effect communication for mobile Ad Hoc network. In this paper, we present an advanced dynamic source routing (ADSR) algorithm for such network. ADSR can select routes according to link state and dynamic delay detection. In the route discovery phase, ADSR finds paths with the greatest link stability factor. In the route ...

We propose a new formalisation of stability for Rely-Guarantee, in which an assertion’s stability is encoded into its syntactic form. This allows two advances in modular reasoning. Firstly, it enables RelyGuarantee, for the first time, to verify concurrent libraries independently of their clients’ environments. Secondly, in a sequential setting, it allows a module’s internal interference to be ...

Since the British National Archives put forward the concept of the digital continuity in 2007. A number of developed countries have developed their digital continuity action plan. Digital continuity has also become a hot spot in the research of electronic records. However, the technology and measures for the protection of the digital continuity are still lack. Data usability is the basis of a d...

Earliest deadline first (edf) is a widely used algorithm for online deadline scheduling. It has been known for long that edf is optimal for scheduling an underloaded, single-processor system; recent results on the extra-resource analysis of edf further revealed that edf when using moderately faster processors can achieve optimal performance in the underloaded, multi-processor setting. This pape...

Asynchronous programming has become ubiquitous in smartphone and web application development, as well as in the development of server-side and system applications. Many of the uses of asynchrony can be modeled by extending programming languages with asynchronous procedure calls—procedures not executed immediately, but stored and selected for execution at a later point by a non-deterministic sch...

This paper describes how the scheduling algorithms and schedulability analysis methods developed for periodic tasks can be extended to provide performance guarantees to semi-periodic tasks. Like periodic tasks, the requests in a semi-periodic task are released regularly. However, their computation times vary widely. We focus on systems where the total maximum utilization of the tasks on each pr...

We propose a purely implicit solution to the contextual assumption generation problem in assume-guarantee reasoning. Instead of improving the L∗ algorithm — a learning algorithm for finite automata, our algorithm computes implicit representations of contextual assumptions by the CDNF algorithm — a learning algorithm for Boolean functions. We report three parametrized test cases where our soluti...

Re nement checking is used to verify implementations against more abstract speci cations. Assume-guarantee reasoning is used to decompose re nement proofs in order to avoid state-space explosion. In previous approaches, speci cations are forced to operate on the same time scale as the implementation. This may lead to unnatural speci cations and ine ciencies in veri cation. We introduce a novel ...

Despite significant advances in the development of model checking, it remains a difficult task in the hands of experts to make it scale to the size of industrial systems. A key step in achieving scalability is to “divide-and-conquer”, that is, to break up the verification of a system into smaller tasks that involve the verification of its components. Assume-guarantee reasoning [9, 11] is a wide...

In this paper, we consider the self-deployment of wireless sensor network. We present a deployment strategy for mobile wireless sensor network which maximizes the sensors covered area with the constraint that the resulting deployment provides a connected topology. Our deployment algorithm is distributed and is based on subset of neighbour for motion decision. Each node is considered as a partic...