Studying the separability relation between finite state machines

Authors:
Natalia Spitsyna;Khaled El-Fakih;Nina Yevtushenko
Affiliations:
Tomsk State University, 36 Lenin Str., Tomsk 634050, Russia;American University of Sharjah, P.O. Box 26666, Sharjah, UAE;Tomsk State University, 36 Lenin Str., Tomsk 634050, Russia
Venue:
Software Testing, Verification & Reliability
Year:
2007

Citing 0
Cited 7

Distinguing Non-deterministic Timed Finite State Machines

FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
QE modeling and test selection based on PNFSM

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Preset and adaptive homing experiments for nondeterministic finite state machines

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs

Information Processing Letters
On deriving test suites for nondeterministic finite state machines with time-outs

Programming and Computing Software
Testing nondeterministic finite state machines with respect to the separability relation

TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
On the length of homing sequences for nondeterministic finite state machines

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several authors have studied the relationships between non-deterministic finite state machines (FSMs). These relationships can be used, for example, for deriving conformance tests from specifications represented by FSMs. In this paper, the separability relation between FSMs is studied. In particular, an algorithm is presented that derives a shortest separating sequence of two non-deterministic FSMs. Given FSMs S with n states and T with m states, it is shown that the upper bound on the length of a shortest separating sequence is 2mn-1. Moreover, the upper bound is shown to be reachable. However, according to the conducted experiments, on average, the length of a shortest separating sequence of FSMs S and T states is less than mn and the existence of a separating sequence significantly depends on the number of non-deterministic transitions in these FSMs. The proposed algorithm can also be used for deriving a separating sequence of two different states of a single FSM or for deriving a separating sequence of three or more FSMs. Copyright © 2007 John Wiley & Sons, Ltd.