FROM A MODEL OF CONCURRENCY TO A TEST MODEL: A GRAPH TRANSFORMATION BASED APPROACH

  • A. CHAOUI MISC Laboratory, Computer Science Department, Faculty of Engineering, University Mentouri Constantine
  • D. SAIDOUNI MISC Laboratory, Computer Science Department, Faculty of Engineering, University Mentouri Constantine
  • M. BOUARIOUA MISC Laboratory, Computer Science Department, Faculty of Engineering, University Mentouri Constantine
  • S. BEKRAR MISC Laboratory, Computer Science Department, Faculty of Engineering, University Mentouri Constantine
  • E. KERKOUCHE MISC Laboratory, Computer Science Department, Faculty of Engineering, University Mentouri Constantine

Résumé

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 meta-
modeling tool ATOM3
 is used. Our approach is illustrated through an example.

Références

[1] AToM3 Home page, version 3.00, http://atom3.cs.mcgill.ca/
[2] Booch,G., J. Rumbaugh, and I. Jacobson, The Unified
Modeling Language User Guide, Addison-Wesley, 1999.
[3] De Lara J., Vangheluwe H.: AToM3: A Tool for Multi-
Formalism Modelling and Meta-Modelling. Proc.
Fundamental Approaches to Software Engineering,
FASE'02, Vol. 2306. LNCS. Grenoble, France, 2002, 174-
188.
[4] FOCOVE tool, http://focove.awardspace.co.uk/focove.html
[5] Kerkouche E., Chaoui A.: A Formal Framework and a Tool
for the Specification and Analysis of G-Nets Models Based
on Graph Transformation. Proc. International Conference on
Distributed Computing and Networking ICDCN’09, LNCS,
Vol. 5408, Springer-Verlag Berlin Heidelberg, India, 2009,
206–211.
[6] Kerkouche E., Chaoui A., Bourennane E., Labbani O.:
Modelling and verification of Dynamic behaviour in UML
models, a graph transformation based approach. Proc.
Software Engineering and Data Engineering SEDE’2009,
Las Vegas, Nevada, USA, 2009.
[7] Python Home page, htpp://www.python.org
[8] Rozenberg G.: Handbook of Graph Grammars and
Computing by Graph Transformation, World Scientific,
1999.
[9] 9. Saidouni D.E: Sémantique de maximalité: application au
raffinement d'actions dans LOTOS, (in French), PhD
Thesis, University of Toulouse, France (1996).
[10] 10. Saidouni D.E., Ghenaï A., Intégration des refus
temporaires dans les graphes de refus, In proceeding of
NOTERE2006, ENSICA, Toulouse, France, June 6-9, 2006,
Edition Lavoisier.
[11] Saidouni D.E. and Belala N.; Using Maximality-Based
Labeled Transition System Model for Concurrency Logic
Verification; The International Arab Journal of Information
Technology, vol 2, No 3, July 2005.
Comment citer
CHAOUI, A. et al. FROM A MODEL OF CONCURRENCY TO A TEST MODEL: A GRAPH TRANSFORMATION BASED APPROACH. Courrier du Savoir, [S.l.], v. 14, mai 2014. ISSN 1112-3338. Disponible à l'adresse : >http://revues.univ-biskra.dz/index.php/cds/article/view/407>. Date de consultation : 08 jui. 2020
Rubrique
Articles