Checking Completeness of Tests for Finite State Machines

In testing from a Finite State Machine (FSM), the generation of test suites which guarantee full fault detection, known as complete test suites, has been a long-standing research topic. In this paper, we present conditions that are sufficient for a test suite to be complete. We demonstrate that the existing conditions are special cases of the proposed ones. An algorithm that checks whether a given test suite is complete is given. The experimental results show that the algorithm can be used for relatively large FSMs and test suites.

Comparing finite state machine test coverage criteria

To plan testing activities, testers face the challenge of determining a strategy, including a test coverage criterion that offers an acceptable compromise between the available resources and test goals. Known theoretical properties of coverage criteria do not always help and, thus, empirical data are needed. The results of an experimental evaluation of several coverage criteria for finite state machines (FSMs) are presented, namely, state and transition coverage; initialisation fault and transition fault coverage. The first two criteria focus on FSM structure, whereas the other two on potential faults in FSM implementations. The authors elaborate a comparison approach that includes random generation of FSM, construction of an adequate test suite and test minimisation for each criterion to ensure that tests are obtained in a uniform way. The last step uses an improved greedy algorithm.

Fault Coverage-Driven Incremental Test Generation

In this paper, we consider a classical problem of complete test generation for deterministic finite-state machines (FSMs) in a more general setting. The first generalization is that the number of states in implementation FSMs can even be smaller than that of the specification FSM. Previous work deals only with the case when the implementation FSMs are allowed to have the same number of states as the specification FSM. This generalization provides more options to the test designer: when traditional methods trigger a test explosion for large specification machines, tests with a lower, but yet guaranteed, fault coverage can still be generated. The second generalization is that tests can be generated starting with a user-defined test suite, by incrementally extending it until the desired fault coverage is achieved. Solving the generalized test derivation problem, we formulate sufficient conditions for test suite completeness weaker than the existing ones and use them to elaborate an algorithm that can be used both for extending user-defined test suites to achieve the desired fault coverage and for test generation. We present the experimental results that indicate that the proposed algorithm allows obtaining a trade-off between the length and fault coverage of test suites.

Coherent state quantization of paragrassmann algebras

By using a coherent state quantization of paragrassmann variables, operators are constructed in finite Hilbert spaces. We thus obtain in a straightforward way a matrix representation of the paragrassmann algebra. This algebra of finite matrices realizes a deformed Weyl-Heisenberg algebra. The study of mean values in coherent states of some of these operators leads to interesting conclusions.

Number of particle creation and decoherence in the nonideal dynamical Casimir effect at finite temperature

In this work we investigate the dynamical Casimir effect in a nonideal cavity by deriving an effective Hamiltonian. We first compute a general expression for the average number of particle creation, applicable for any law of motion of the cavity boundary, under the only restriction of small velocities. We also compute a general expression for the linear entropy of an arbitrary state prepared in a selected mode, also applicable for any law of motion of a slow moving boundary. As an application of our results we have analyzed both the average number of particle creation and linear entropy within a particular oscillatory motion of the cavity boundary. On the basis of these expressions we develop a comprehensive analysis of the resonances in the number of particle creation in the nonideal dynamical Casimir effect. We also demonstrate the occurrence of resonances in the loss of purity of the initial state and estimate the decoherence times associated with these resonances. Since our results were obtained in the framework of the perturbation theory, they are restricted, under resonant conditions, to a short-time approximation. (C) 2009 Elsevier Inc. All rights reserved.

QUASISTATIONARY DISTRIBUTIONS AND FLEMING-VIOT PROCESSES IN FINITE SPACES

Consider a continuous-time Markov process with transition rates matrix Q in the state space Lambda boolean OR {0}. In In the associated Fleming-Viot process N particles evolve independently in A with transition rates matrix Q until one of them attempts to jump to state 0. At this moment the particle jumps to one of the positions of the other particles, chosen uniformly at random. When Lambda is finite, we show that the empirical distribution of the particles at a fixed time converges as N -> infinity to the distribution of a single particle at the same time conditioned on not touching {0}. Furthermore, the empirical profile of the unique invariant measure for the Fleming-Viot process with N particles converges as N -> infinity to the unique quasistationary distribution of the one-particle motion. A key element of the approach is to show that the two-particle correlations are of order 1/N.