• Corpus ID: 14228965

A Family of Coverage Testing Criteria for Coloured Petri Nets

  title={A Family of Coverage Testing Criteria for Coloured Petri Nets},
  author={Adenilso da Silva Sim{\~a}o and Simone do Rocio Senger de Souza and Jos{\'e} Carlos Maldonado},
In this paper, we propose a family of specification-based coverage testing criteria for Coloured Petri Nets (CPNs). CPNs are an extension of Petri Nets with the capability of expressing, defining and handling datatypes and structured values. The main approaches used for testing and validation of CPNs based on specifications are simulation and analysis of properties. However, these approaches do not essentially provide a mechanism for quantifying the testing activity, compromising the testing… 

Figures and Tables from this paper

Coverage Analysis of Net Inscriptions in Coloured Petri Net Models
This paper considers Modified Condition/Decision Coverage (MC/DC) which generalises branch coverage of SML decisions and establishes a link between coverage analysis known from programming languages and net inscriptions of CPN models.
A contribution to the fault-based testing of aspect-orientd software
A series of quantitative studies show that the proposed fault taxonomy is able to categorise faults identified from several available AO systems, and shows that the mutation operators are able to simulate faults that may not be revealed by pre-existing, non-mutation-based test suites.
Sim / CPN : A Web-Based Simulator for Coloured Petri Nets
A WEB based tool — named Sim/CPN— for simulation of Coloured Petri Nets is presented, which allows for users to simulate the nets over the internet, being available to a wide range of users.
What a Long, Strange Trip It's Been: Past, Present, and Future Perspectives on Software Testing Research
A synthesis of its rich 25-year history of research on software testing synthesized to shed some light on the state-of-the-art of software testing in Brazil and provide an outlook on its foreseeable future.
Verification and Evaluation of Computer and Communication Systems: 14th International Conference, VECoS 2020, Xi'an, China, October 26–27, 2020, Proceedings
This work proposes an algorithm that a reduced supervisor can be separated from the supremal supervisor if a sufficient condition is satisfied, and the algorithm for checking the necessary condition is presented.


Mutation Testing Applied to Validate Specifications Based on Petri Nets
The objective of this work is to evaluate the adequacy of applying the Mutation Analysis criterion to validate Petri Net based specifications and examine the ideas of constrained and randomly selected mutation in this context.
A test sequence selection method for protocol testing
A method for automated selection of test sequences from a protocol specification given in Estelle for the purpose of testing both control and data flow aspects of a protocol implementation is
Coloured Petri Nets
  • K. Jensen
  • Computer Science
    EATCS Monographs in Theoretical Computer Science
  • 1992
Coloured Petri nets (CPN) is a formalism which extends ordinary Petri nets by adding data types and modularity. This means that is possible to make succinct, readable and structured models. The CPN
Mutation Testing Applied to Estelle Specifications
A strategy for validating Estelle-based specification is proposed and exemplified using the Alternating-bit protocol, addressing the validation of the behavior of the modules, the communication among modules and the architecture of the specification.
Test Selection Based on Finite State Models
A method for the selection of appropriate test case, an important issue for conformance testing of protocol implementations as well as software engineering, is presented and is shown to have general applicability, full fault-detection power, and yields shorter test suites than the W-method.
Mutation testing applied to validate specifications based on statecharts
A mutation operator set for statecharts, one of the crucial points for effectively applying mutation testing is defined, and strategies to abstract the statechart components according to different statechart features that may comprise the testing and validation activity aims are provided.
A Formal Analysis of the Subsume Relation Between Software Test Adequacy Criteria
  • Hong Zhu
  • Computer Science
    IEEE Trans. Software Eng.
  • 1996
The posterior testing scenario is investigated and it is proved that in this scenario the subsume relation does guarantee a better fault detecting ability.
On Fault Coverage of Tests for Finite State Specifications
Mutation analysis testing for finite state machines
The application of the mutation analysis criterion in the context of specifications based on finite state machines is proposed, and evidences are given that the use of mutation analysis is effective in this context.
An incremental approach to structural testing of concurrent software
The incremental testing approach is to integrate processes in P in a bottom-to-top manner to alleviate the state explosion problem and offers other advantages.