Communicating Stream X-Machines Systems are no more than X-Machines

Tudor Balanescu (Faculty of Sciences, Pitesti University, Romania)

Anthony J. Cowling (Department of Computer Science, Sheffield University, UK)

Horia Georgescu (Faculty of Mathematics, Bucharest University, Romania)

Marian Gheorghe (Faculty of Sciences, Pitesti University, Romania)

Mike Holcombe (Department of Computer Science, Sheffield University, UK)

Cristina Vertan (Faculty of Mathematics, Bucharest University, Romania)

Abstract: A version of the communicating stream X-machine model is proposed, which gives a precise representation of the operation of transferring data from one X-machine to another. For this model it is shown that systems of communicating X-machines have the same computational power as single stream X-machines. This enable existing methods for deriving test strategies for stream X-machines to be extended to communicating stream X-machines.

Keywords: communicating Stream X-machines system, communicating matrix, communicating states, processing states, software specification language, testing

Categories: D.2.5, F.1.2, F.3.1