Multi-timed Bisimulation for Distributed Timed Automata

Ortiz, James Jerson; Amrani, Moussa; Schobbens, Pierre‐Yves

doi:10.1007/978-3-319-57288-8_4

Cited by 4 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, to be computationally tractable, the SMI-NR is incomplete. Therefore, we present an approach to detect and remove duplicate mutants after mutant generation by using a timed bisimulation algorithm [10], [35]. MUPPAAL uses Ortiz et al' timed bisimulation algorithm [35].…”

Section: B Detecting Duplicate Mutantsmentioning

confidence: 99%

“…Therefore, we present an approach to detect and remove duplicate mutants after mutant generation by using a timed bisimulation algorithm [10], [35]. MUPPAAL uses Ortiz et al' timed bisimulation algorithm [35]. Because timed bisimulation's complexity is EXPTIME [10], if the bisimulation process takes longer than the specified time to analyse a pair of mutants, our algorithm will stop the bisimulation process.…”

Section: B Detecting Duplicate Mutantsmentioning

confidence: 99%

“…Because timed bisimulation's complexity is EXPTIME [10], if the bisimulation process takes longer than the specified time to analyse a pair of mutants, our algorithm will stop the bisimulation process. Algorithm 1 describes how MUPPAAL detects duplicates using timed bisimulation [35]. It works as follows.…”

Section: B Detecting Duplicate Mutantsmentioning

confidence: 99%

“…1) We introduce a novel timed mutation operator, SMI-NR, that we proved to prevent duplicate mutants by design; 2) We detect duplicate mutants using a timed bisimulation algorithm [35] to assess behavioural equivalence between two mutants. When duplicate mutants are detected, we keep only one of them; 3) We provide a random simulation baseline to compare to timed bisimulation: If, for a mutant, we can find a trace that the other mutant cannot execute, then we can conclude that the two mutants are not duplicates.…”

Section: Introductionmentioning

confidence: 99%

“…The heuristic suggests a pair of mutants as duplicates otherwise; 4) We implemented MUPPAAL using the UPPAAL execution engine for TAs and UPPAAL-TRON [30] for timed trace generation and checking. In addition to the above contributions, MUPPAAL supports mutation operators for TA from [1], [6], [35] avoiding equivalent mutants using refinement prevention [5], [6]; 5) We assessed MUPPAAL 1 . Our results on four cases indicate that timed bisimulation offers the best tradeoff between performance and accuracy of detection.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

MUPPAAL: Reducing and Removing Equivalent and Duplicate Mutants in UPPAAL

Cuartas,

Aranda,

Cordy

et al. 2023

2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)

Self Cite

View full text Add to dashboard Cite

Mutation Testing (MT) is a test quality assessment technique that creates mutants by injecting artificial faults into the system and evaluating the ability of tests to distinguish these mutants. We focus on MT for safety-critical Timed Automata (TA). MT is prone to equivalent and duplicate mutants, the former having the same behaviour as the original system and the latter other mutants. Such mutants bring no value and induce useless test case executions. We propose MUPPAAL, a tool that:(1) offers a new operator reducing the occurrence of mutant duplicates; (2) an efficient bisimulation algorithm removing remaining duplicates; (3) leverages existing equivalence-avoiding mutation operators. Our experiments on four UPPAAL case studies indicate that duplicates represent up to 32% of all mutants and that the MUPPAAL bisimulation algorithm can identify them more than 99% of the time.

show abstract

Section: B Detecting Duplicate Mutantsmentioning

confidence: 99%