Timed Wp-method: testing real-time systems

En‐Nouaary, Abdeslam; Dssouli, Rachida; Khendek, Ferhat

doi:10.1109/tse.2002.1049402

Cited by 112 publications

(124 citation statements)

References 27 publications

Supporting

Mentioning

118

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, the ability of UPPAAL to handle timed specifications we will apply our approach on timed state characterization problems [ENN02]. In order to achieve better performance of our approach, we plan to adapt this method to heuristic and symbolic model checking approaches.…”

Section: Resultsmentioning

confidence: 99%

Extended state identification and verification using a model checker

Robinson-Mallett

Liggesmeyer

Mücke³

et al. 2006

Information and Software Technology

View full text Add to dashboard Cite

This paper presents a method for the application of model checking, i.e. verifying a finite state system against a given temporal specification, to the problem of generating test inputs. The generated test inputs allow state characterization, i.e. the identification and verification of internal states of the software under test by observation of the input/output behavior only. A test model is derived semiautomatically from a given state based specification and the testing goal is specified in terms of temporal logic. On the basis of these inputs, a model checking tool performs the testing input generation automatically. In consequence, the complexity of our approach is depending on the input model, the testing goal, and the applied model checking algorithm. The presented approach can be adapted with small changes to other model checking tools. It is a capable test generation method, whenever a state based behavioral specification of the software under test exists. Furthermore, it provides a descriptive view on state based testing, which may be beneficial in other contexts, e.g. education and program comprehension.

show abstract

Section: Resultsmentioning

confidence: 99%

Extended state identification and verification using a model checker

Robinson-Mallett

Liggesmeyer

Mücke³

et al. 2006

Information and Software Technology

View full text Add to dashboard Cite

show abstract

“…En-Nouaary et al [7] consider a variant of timed automata with inputs and outputs (TAIOs) with no data. The model considers only urgent transitions, i.e., once enabled, a transition must be taken immediately.…”

Section: Related Workmentioning

confidence: 99%

“…Other approaches extend some classic testing strategies to support the test of RTS, for instance, coverage based test selection [4] and test purposes to select specific scenarios to be verified [5], [6]. Also, some approaches extend finite state machines (FSMs) and their associated methods to deal with time [7], [8].…”

Section: Introductionmentioning

confidence: 99%

Abstracting Time and Data for Conformance Testing of Real-Time Systems

Andrade

Machado

Jéron

et al. 2011

2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops

View full text Add to dashboard Cite

Abstract-Current approaches to model-based conformance testing of real-time systems are mostly based either on finite state machines/transition systems or on timed automata. However, most real-time systems manipulate data while being subject to time constraints. The usual solution consists in enumerating data values (in finite domains) while treating time symbolically, thus leading to the classical state explosion problem. This paper proposes a new model of real-time systems as an extension of both symbolic transition systems and timed automata, in order to handle both data and time requirements symbolically. We then adapt the tioco conformance testing theory to deal with this model and describe a test case generation process based on a combination of symbolic execution and constraint solving for the data part and symbolic analysis for timed aspects.

show abstract

“…In particular, the testing community has shown a growing interest to take into account time aspects (e.g. [31,12,24,49,46,15,29,7,18,35,34,44,48]). …”

Section: Introductionmentioning

confidence: 99%

Testing timed systems modeled by Stream X-machines

2009

View full text Add to dashboard Cite

Stream X-machines have been used to specify real systems requiring to represent complex data structures. They are a kind of extended finite state machine using a shared memory to specify communications between the components of systems. In this paper we introduce an extension of the Stream X-machines formalism in order to specify systems that present temporal requirements. On the one hand, we consider that (output) actions take time to be performed. On the other hand, our formalism allows to specify timeouts. Timeouts represent the time a system can wait for the environment to react. Since timeous affect the set of available actions of the system, a relation focusing on the functional behavior of systems, that is, the actions that they can perform, must explicitly take into account the possible timeouts. We also propose a formal testing methodology allowing to systematically test a system with respect to a specification. Finally, we introduce a test derivation algorithm. Given a specification, the derived test suite is sound and complete, that is, a system under test successfully passes the test suite if and only if this system conforms to the specification.

show abstract

Timed Wp-method: testing real-time systems

Cited by 112 publications

References 27 publications

Extended state identification and verification using a model checker

Extended state identification and verification using a model checker

Abstracting Time and Data for Conformance Testing of Real-Time Systems

Testing timed systems modeled by Stream X-machines

Contact Info

Product

Resources

About