Model‐based testing for concurrent systems with labelled event structures. (21st August 2014)

• Record Type: Journal Article
• Authors: de León, Hernán Ponce; Haar, Stefan; Longuet, Delphine; Brucker, Achim D.; Julliand, Jacques
• Is Part Of: Software testing, verification & reliability. Volume 24:Number 7(2014)
• Page Start: 558
• Page End: 590
• Publication Date: 2014-08-21
• Subjects: Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1543
• Languages: English
• ISSNs: 0960-0833

Abstract

<abstract abstract-type="main" id="stvr1543-abs-0001"> <title>SUMMARY</title> <p id="stvr1543-para-0001">We propose a theoretical testing framework and a test generation algorithm for concurrent systems specified with true‐concurrency models, such as Petri nets or networks of automata. The semantic model of computation of such formalisms is labelled event structures, which allow to represent concurrency explicitly. We introduce the notions of strong and weak concurrency: strongly concurrent events must be concurrent in the implementation, while weakly concurrent ones may eventually be ordered. The <bold>ioco</bold> type conformance relations for sequential systems rely on the observation of sequences of actions and blockings; thus, they are not capable of capturing and exploiting concurrency of non‐sequential behaviours. We propose an extension of <bold>ioco</bold> for labelled event structures, named <bold>co‐ioco</bold>, allowing to deal with strong and weak concurrency. We extend the notions of test cases and test execution to labelled event structures and give a test generation algorithm building a complete test suite for <bold>co‐ioco</bold>. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>