Please use this identifier to cite or link to this item:
http://archives.univ-biskra.dz/handle/123456789/656
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | CHAOUI, A | - |
dc.contributor.author | SAIDOUNI, D | - |
dc.contributor.author | BOUARIOUA, M | - |
dc.contributor.author | BEKRAR, S | - |
dc.contributor.author | KERKOUCHE, E | - |
dc.date.accessioned | 2013-12-30T17:13:22Z | - |
dc.date.available | 2013-12-30T17:13:22Z | - |
dc.date.issued | 2013-12-30 | - |
dc.identifier.uri | http://archives.univ-biskra.dz/handle/123456789/656 | - |
dc.description.abstract | Maximality-based Labeled Transition Systems (MLTS) is semantic model for true concurrency. In other hand Mixed Refusal Graphs (MRG) are models for formal testing. In this paper, we propose an approach to transform an MLTS model to an equivalent MRG model. Since the input and output models are graphs, we use graph transformation to perform this transformation automatically. So, we propose two meta-models; one for the input model and the other for the output model. Then, based on these meta-models we propose a graph grammar that deals with the transformation process. The metamodeling tool ATOM3 is used. Our approach is illustrated through an example. | en_US |
dc.language.iso | en | en_US |
dc.subject | Formal Verification | en_US |
dc.subject | Graph transformation | en_US |
dc.subject | MLTS | en_US |
dc.subject | MRG | en_US |
dc.subject | ATOM3 | en_US |
dc.subject | Meta-models | en_US |
dc.subject | Test model | en_US |
dc.title | FROM A MODEL OF CONCURRENCY TO A TEST MODEL: A GRAPH TRANSFORMATION BASED APPROACH | en_US |
dc.type | Article | en_US |
Appears in Collections: | CS N 14 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
3-chaoui.pdf | 660,36 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.