Please use this identifier to cite or link to this item: http://archives.univ-biskra.dz/handle/123456789/656
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHAOUI, A-
dc.contributor.authorSAIDOUNI, D-
dc.contributor.authorBOUARIOUA, M-
dc.contributor.authorBEKRAR, S-
dc.contributor.authorKERKOUCHE, E-
dc.date.accessioned2013-12-30T17:13:22Z-
dc.date.available2013-12-30T17:13:22Z-
dc.date.issued2013-12-30-
dc.identifier.urihttp://archives.univ-biskra.dz/handle/123456789/656-
dc.description.abstractMaximality-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.isoenen_US
dc.subjectFormal Verificationen_US
dc.subjectGraph transformationen_US
dc.subjectMLTSen_US
dc.subjectMRGen_US
dc.subjectATOM3en_US
dc.subjectMeta-modelsen_US
dc.subjectTest modelen_US
dc.titleFROM A MODEL OF CONCURRENCY TO A TEST MODEL: A GRAPH TRANSFORMATION BASED APPROACHen_US
dc.typeArticleen_US
Appears in Collections:CS N 14

Files in This Item:
File Description SizeFormat 
3-chaoui.pdf660,36 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.