Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421859 | Electronic Notes in Theoretical Computer Science | 2010 | 16 Pages |
Abstract
We present a new abstraction of reactive systems interacting with databases. This abstraction is intended to be used for model-based testing. We abstract the database into two sets: present set and absent set, and present a proof of this abstraction. We present two extensions of FSM, the DBFSM and PAFSM. DBFSM are a form of FSM incorporating databases. PAFSM are an abstraction of DBFSM using present-absent sets. Depending on what type of testing is to be done, the translation is tailored to fit this purpose. We show how this translation is related to the present-absent abstraction. Finally, we illustrate the approach through a small example and show how this can be used for testing with the model-based testing tool Uppaal TRON.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics