The paper presents the experimental comparison of the quality of three test suites based on the model of a Finite State Machine with timeouts, namely, the explicit enumeration of faulty mutants, transition tour and TFSM-based black-box test. Test suites are then applied to the program, automatically generated via the UML tool. The experimental results on the quality of the above mentioned test ...

State Machine Language (AsmL) AsmL is an extended finite state machine-based executable software specification language which has also been used to specify attack scenarios [41]. The authors argue that due to the extended finite state machine-based nature of AsmL, attacks with multiple steps can be specified in AsmL. Such attack scenarios can be automatically translated into Snort rules which c...

In this paper, we show that when it is possible to use feedback in the specification of “motor programs,” the length of the descriptions of the instruction sequences for carrying out a given task can be reduced by a factor that reflects the richness of the available feedback signals. The model on which this work is based is that of a finite automaton, modified in such a way that instruction pro...

Two-way finite state transducers are considered with a fixed number of pebbles, of which the life times are nested. In the deterministic case, the transductions computed by such pebble transducers are closed under composition, and they can be realized by the composition of one-pebble transducers. The ranges of the k-pebble transducers form a hierarchy with respect to k, their finiteness problem...

This paper discusses security issues and considers the extent to which internal relations among entities in a system should be taken into account when carrying out security analysis. We present a concrete and flexible security model expressed in terms of the internal relations in the system, rather than abstract state machines. Based on this model, security analysis can be carried out by decomp...

State Machines: Verification Problems and Complexity Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Informatiker Marc Spielmann aus Duisburg Referent: Universitätsprofessor Dr. E. Grädel Koreferent...

Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of intere...

We associate to each variety of algebras of finite signature a function on the positive integers called the equational complexity of the variety. This function is a measure of how much of the equational theory of a variety must be tested to determine whether a finite algebra belongs to the variety. We provide general methods for giving upper and lower bounds on the growth of equational complexi...

This paper describes a framework to construct interface agents with example dialogs based on the tasks by the machine learning technology. The Wizard of Oz method is used to collect example dialogs, and a finite state machine-based model is used for the dialog model. We implemented a Web-based system which includes these functions, and empirically examined the system which treats with a guide t...