Specification-based Testing of Concurrent Systems

The paper addresses the problem of test suite derivation from a formal specification of a distributed concurrent software system given as a collection of labeled transition systems. It presents a new concurrency model, called behavior machine, and its construction algorithm. Further, the paper outlines how test derivation can be based on the new concurrency model in order to derive test suites that still exhibit true concurrency between test events. A toolset is presented to support the generation of concurrent test suites from specifications given in the formal description technique LOTOS. Finally, some comments on requirements for the design of a distributed test architecture are given.

[1]  O. Henniger.  On test case generation from asynchronously communicating state machines , 1997 .

[2]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[3]  Alfred V. Aho,et al.  An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours , 1991, IEEE Trans. Commun..

[4]  Myungchul Kim,et al.  An approach for testing asynchronous communicating systems , 1996 .

[5]  Andreas Ulrich,et al.  An approach to testing distributed software systems , 1995, PSTV.

[6]  Joseph Sifakis,et al.  Compilation and verification of LOTOS specifications , 1990, PSTV.

[7]  Paul Pettersson,et al.  Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part II , 1998, TACAS.

[8]  Eike Best,et al.  PEP - More than a Petri Net Tool , 1996, TACAS.

[9]  David Lee,et al.  Conformance testing of protocols specified as communicating FSMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[10]  Thierry Jéron,et al.  Using On-The-Fly Verification Techniques for the Generation of test Suites , 1996, CAV.

[11]  Alexandre Petrenko,et al.  On Fault Coverage of Tests for Finite State Specifications , 1996, Comput. Networks ISDN Syst..

[12]  Rom Langerak.  A Testing Theory for LOTOS using Deadlock Detection , 1989, PSTV.

[13]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[14]  Andreas Ulrich.  A Description Model to Support Test Suit Derivation for Concurrent Systems , 1997, Kommunikation in Verteilten Systemen.

[15]  Hubert Garavel,et al.  Specification and Verification of Various Distributed Leader Election Algorithms for Unidirectional Ring Networks , 1997, Sci. Comput. Program..

[16]  Hon Fung Li,et al.  Partial-Order Model Checking: A Guide for the Perplexed , 1991, CAV.

[17]  Richard H. Carver,et al.  Debugging Concurrent Ada Programs by Deterministic Execution , 1991, IEEE Trans. Software Eng..

[18]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 1996, Formal Methods Syst. Des..