Towards Overcoming Issues of Testing Probabilistic Distributed systems

Testing a distributed system, to ensure its conformance to the specification, involves usually placing a set of parallel testers called PTCs (Parallel Test Components) attached to each port of the implementation under test (IUT). As a result, many problems known as controllability, observability and synchronisation fault detections occur while testing such distributed systems. Hence, the design process should take into consideration the mechanisms and functions needed to support interaction, communication and coordination between the distributed components especially if the implementation exhibits a stochastic behaviour.In this paper, we use probabilistic automaton to model and analyse the stochastic behaviour of the implementation under test. Then, we propose an algorithm for generating probabilistic local test sequences (PLTS) for each tester guarantying to avoid problems of coordination, observation and synchronization during the testing process.

[1]  James A. Whittaker,et al.  A Markov chain model for predicting the reliability of multi-build software , 2000, Inf. Softw. Technol..

[2]  Salma Azzouzi,et al.  A Synchronized Test Control Execution Model of Distributed Systems , 2020, Int. J. Grid High Perform. Comput..

[3]  Gang Luo,et al.  Test generation with respect to distributed interfaces , 1994 .

[4]  Henrik C. Bohnenkamp,et al.  Timed Testing with TorX , 2005, FM.

[5]  Robert M. Hierons.  Testing a distributed system: generating minimal synchronised test sequences that detect output-shifting faults , 2001, Inf. Softw. Technol..

[6]  Hong-wei Zeng,et al.  Multiple UIO-based test sequence generation for distributed systems , 2008 .

[7]  Robert M. Hierons,et al.  Implementation relations and probabilistic schedulers in the distributed test architecture , 2017, J. Syst. Softw..

[8]  Salma Azzouzi,et al.  A colored Petri-net model for control execution of distributed systems , 2017, 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT).

[9]  Salma Azzouzi,et al.  A JESS AGENT Based Architecture for Testing Distributed Systems , 2014, J. Inf. Sci. Eng..

[10]  Jenny Morales,et al.  Computations for Markov Chain Usage Models , 2003 .

[11]  Robert M. Hierons,et al.  Mutation testing from probabilistic and stochastic finite state machines , 2009, J. Syst. Softw..

[12]  Ling Cheung,et al.  A testing scenario for probabilistic processes , 2007, JACM.

[13]  Salma Azzouzi,et al.  A temporal agent based approach for testing open distributed systems , 2015, Comput. Stand. Interfaces.

[14]  Mariëlle Stoelinga,et al.  Model-based testing of probabilistic systems , 2016, Formal Aspects of Computing.

[15]  Mariëlle Stoelinga,et al.  Model-based testing of stochastically timed systems , 2019, Innovations in Systems and Software Engineering.

[16]  Kuo-Chung Tai,et al.  Synchronizable Test Sequences of Finite State Machines , 1995, Comput. Networks.

[17]  Robert M. Hierons,et al.  Conditions for Resolving Observability Problems in Distributed Testing , 2004, FORTE.

[18]  Salma Azzouzi,et al.  Testing Rules for Mapreduce Fameworks , 2018, 2018 IEEE 5th International Congress on Information Science and Technology (CiSt).

[19]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[20]  Jesse H. Poore,et al.  Statistical testing of software based on a usage model , 1995, Softw. Pract. Exp..

[21]  Salma Azzouzi,et al.  FSM Modeling of Testing Security Policies for MapReduce Frameworks , 2019, 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT).