Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423754 | Electronic Notes in Theoretical Computer Science | 2008 | 20 Pages |
Abstract
Model-based testing automatically generates test cases from a model describing the behavior of the system under test. Although there exist several model-based formal testing methods, they usually do not address time constraints, mainly due to the fact that some supporting formalisms do not allow a suitable representation of time. In this paper, we consider such constraints in a framework of Timed Extended Finite State Machines (TEFSMs), which augment the Extended Finite State Machine (EFSM) model by including a notion of explicit and implicit time advancement. We use this extension to address conformance testing by reducing the confirming configuration problem to the problem of finding a path in a TEFSM product.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics