Generating optimal distinguishing sequences with a model checker

Authors:
Christopher Robinson-Mallett;Peter Liggesmeyer;Tilo Mücke;Ursula Goltz
Affiliations:
University of Potsdam, Germany;University of Kaiserslautern, Germany;University of Brunswick, Germany;University of Brunswick, Germany
Venue:
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
Year:
2005

Citing 8
Cited 4

A protocol test generation procedure

Computer Networks and ISDN Systems
Formal Methods for Protocol Testing: A Detailed Study

IEEE Transactions on Software Engineering
Formal methods for test sequence generation

Computer Communications
A theory of timed automata

Theoretical Computer Science
Protocol testing: review of methods and relevance for software testing

ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
UPPAAL—a tool suite for automatic verification of real-time systems

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Fast state verification

DAC '98 Proceedings of the 35th annual Design Automation Conference
Testing Finite-State Machines: State Identification and Verification

IEEE Transactions on Computers

Achieving communication coverage in testing

ACM SIGSOFT Software Engineering Notes
Using communication coverage criteria and partial model generation to assist software integration testing

Software Quality Control
An Approach to Testing with Embedded Context Using Model Checker

ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Feature Interaction Aware Test Case Generation for Embedded Control Systems

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach for the automatic generation of shortest Distinguishing Sequences (DS) with the Uppaal model checker. The presented method is applicable to a large number of extended finite state machines and it will find an optimal result, if a DS sequence exists for the considered automaton. Our approach is situated in an integrated testing environment that is used to generate checking sequences. The generation method is based on a DS model, which is derived from the same test model that is used for generating test cover sets. The problem of generating DS is reduced to the definition of a DS model and for this reason the complexity of our approach depends mainly on the used model checking algorithm. This means, that the presented method is automatically improved, when the model checking algorithm is improved. This includes the generation of optimal DS depending on the ability of the model checker to produce optimal results.