For the two-sample location problem we consider a general class of tests, all members of it are based on U-statistics. The asymptotic efficicacies are investigated in detail. We construct an adaptive test where all statistics ...

A technique to describe and to verify distributed algorithms is suggested. This technique (based on Petri nets) reduces the modelling- and analysis effort to a reasonable expenditure. The paper outlines the technique along ...

There exist many different Petri net formalisms. In this paper, we present the Petri Net Cube which helps to structure and classify the variety of Petri net formalisms. We show, that three basic aspects are sufficient for ...

Gurevich’s sequential Abstract State Machines (ASMs) are taken as a basis for the construction of distributed ASMs as sets of sequential ASMs. A theorem on the expressive power of distributed ASM is proven in analogy to ...

Research on dependable computing is undergoing a shift from traditional fault tolerance towards techniques that handle faults proactively. These techniques comprise two parts: (a) prediction of failures and (b) actions ...

Um Entwurf und Verifikation komplizierter verteilter Algorithmen leichter und verständlicher zu machen, wird oft eine Verfeinerungsmethode verwendet. Dabei wird ein einfacher Algorithmus, der gewünschte Eigenschaften ...

The development of software for wireless sensor networks is involved and complex. This does not only impose much work on programmers but also prevents domain experts from directly contributing parts of the software. ...