Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Formal black box testing for partially specified deterministic finite state machines

Balanescu T., Gheorghe M., Ipate F., Holcombe M.

Foundations of Computing and Decision Sciences

2003

Vol. 28, No. 1

17-28

One of the most important methods of generating test sets for software modelled by finite state machines is Chow's W-method. However, the W-method is only proved to work if both the specification and the implementation are completely-specified deterministic finite state machines (i.e. there is a transition for any state and any input symbol). This paper extends the W-method to (possibly) partially specified deterministic finite state machines. It shows that, by slightly augmenting the test set, the W-method remains valid in this, more general, case. It is also shown how this generalised W--method can be used to generate test sets for a type of extended finite state machines, called stream X-machines (Eilenberg machines).

P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)

Aguado J., Balanescu T., Cowling T., Gheorghe M., Holcombe M., Ipate F.

Fundamenta Informaticae

2002

Vol. 49, nr 1-3

17-33

The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the parallel behaviour of the regions of a P system is simulated by a sequential process involving a single X-machine. This allows the application of the X-machine testing procedures in order to prove the correctness of P systems. In the second approach, a P system is simulated by a communicating system of X-machines. Each component of such a system is an X-machine associated with a region of the given P system. The components act in parallel, as their counterparts do in a P system, and use some specific mechanism for communication and synchronisation.