Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce

Journal of Big Data

Zineb Lotfi¹  Faissal Ouardi¹  Sébastien Verel²  Bilal Elghadyry³ 

[1] ANISSE research Team, Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, B.P. 1014, Rabat, Morocco;Univ. Littoral Côte d’Opale, UR 4491, LISIC, Laboratoire d’Informatique Signal et Image de la Côte d’Opale, 62100, Calais, France;Univ. Littoral Côte d’Opale, UR 4491, LISIC, Laboratoire d’Informatique Signal et Image de la Côte d’Opale, 62100, Calais, France;ANISSE research Team, Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, B.P. 1014, Rabat, Morocco;

关键词: Conformance test;    Finite state machines;    Parallel algorithm;    MapReduce framework;   

DOI  :  10.1186/s40537-021-00535-6

来源: Springer

【 摘 要 】

Distinguishing sequences are widely used in finite state machine-based conformance testing to solve the state identification problem. In this paper, we address the scalability issue encountered while deriving distinguishing sequences from complete observable nondeterministic finite state machines by introducing a massively parallel MapReduce version of the well-known Exact Algorithm. To the best of our knowledge, this is the first study to tackle this task using the MapReduce approach. First, we give a concise overview of the well-known Exact Algorithm for deriving distinguishing sequences from nondeterministic finite state machines. Second, we propose a parallel algorithm for this problem using the MapReduce approach and analyze its communication cost using Afrati et al. model. Furthermore, we conduct a variety of intensive and comparative experiments on a wide range of finite state machine classes to demonstrate that our proposed solution is efficient and scalable.

【 授权许可】

CC BY