Unfolding-Based Test Selection for Concurrent Conformance

Model-based testing has mainly focused on models where currency is interpreted as interleaving (like the ioco theory for labeled transition systems), which may be too coarse when one wants concurrency to be preserved in the implementation. In order to test such concurrent systems, we choose to use Petri nets as specifications and define a concurrent conformance relation named co-ioco. We propose a test generation algorithm based on Petri net unfolding able to build a complete test suite w.r.t our co-ioco conformance relation. In addition we propose a coverage criterion based on a dedicated notion of complete prefixes that selects a manageable test suite.

[1]  Thierry Jéron.  Symbolic Model-based Test Selection , 2009, Electron. Notes Theor. Comput. Sci..

[2]  Robert M. Hierons,et al.  Implementation Relations for the Distributed Test Architecture , 2008, TestCom/FATES.

[3]  Thierry Jéron,et al.  TGV : theory , principles and algorithms A tool for the automatic synthesis of conformance test cases for non-deterministic reactive systems , 2004 .

[4]  Alexandre Petrenko,et al.  Testing of Software and Communicating Systems , 2007, Lecture Notes in Computer Science.

[5]  Christophe Gaston,et al.  Symbolic Execution Techniques for Test Purpose Definition , 2006, TestCom.

[6]  Stavros Tripakis,et al.  Conformance testing for real-time systems , 2009, Formal Methods Syst. Des..

[7]  Stefan Haar,et al.  Model‐based testing for concurrent systems with labelled event structures , 2014, Softw. Test. Verification Reliab..

[8]  Hartmut König,et al.  Specification-based Testing of Concurrent Systems , 1997, FORTE.

[9]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[10]  Lex Heerink,et al.  Refusal Testing for Classes of Transition Systems with Inputs and Outputs , 1997, FORTE.

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

[12]  Gregor von Bochmann,et al.  Testing Systems Specified as Partial Order Input/Output Automata , 2008, TestCom/FATES.

[13]  Hernán Ponce de León,et al.  Model Based Testing for Concurrent Systems with Labeled Event Structures , 2013 .

[14]  Jan Tretmans,et al.  Test Generation with Inputs, Outputs, and Quiescence , 1996, TACAS.

[15]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[16]  Glynn Winskel,et al.  Petri nets, morphisms and compositionality , 1985, Applications and Theory in Petri Nets.

[17]  Claude Jard,et al.  Testing Input/Output Partial Order Automata , 2007, TestCom/FATES.

[18]  Steve A. Schneider,et al.  Concurrent and Real-time Systems: The CSP Approach , 1999 .

[19]  Christophe Gaston,et al.  Test Purpose Concretization through Symbolic Action Refinement , 2008, TestCom/FATES.

[20]  Jim Woodcock,et al.  FME'96: Industrial Benefit and Advances in Formal Methods , 1996, Lecture Notes in Computer Science.

[21]  Steve Schneider,et al.  Concurrent and Real Time Systems , 1999 .

[22]  Roberto Segala,et al.  Quiescence, Fairness, Testing, and the Notion of Implementation , 1997, Inf. Comput..

[23]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[24]  Stefan Haar,et al.  Conformance Relations for Labeled Event Structures , 2012, TAP@TOOLS.

[25]  Jan Peleska,et al.  From Testing Theory to Test Driver Implementation , 1996, FME.

[26]  Grégory Lestiennes,et al.  Test de systèmes réactifs non réceptifs , 2005 .

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

[28]  Katalin Tarnay,et al.  Testing of Communicating Systems , 1999, IFIP — The International Federation for Information Processing.

[29]  Sabina Petride,et al.  Review of "Concurrent and real-time systems: the CSP approach" by Steve Schneider. Wiley 1999. , 2004, SIGA.