By Topic

Using graph grammars and meta-modeling to process code mobility in LRN models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nardjess Dehimi ; MISC Laboratory, Department of Computer Science, University of Constantine, Algeria ; Allaoua Chaoui

Petri nets have been proposed initially to model concurrency and distributed systems. The ordinary formalism is so simple with a smart formal background, but it fails in modeling mobility aspects. In spite of this, searchers in mobility modeling domain are attracted by Petri nets, and many extensions have been proposed to treat mobility aspects. Among these, we find Labeled Reconfigurable Nets (LRN), This new formalism allows explicit modeling of computational environments and processes mobility between them. It allows, in a simple and an intuitive approach, modeling mobile code paradigms (mobile agent, code on demand, remote evaluation). In this paper, we propose an approach based on the combined use of Meta-modeling and Graph Grammars to automatically generate a visual modeling tool for LRN, for analysis and simulation purposes. This tool produces graphical models, highly-structured to reach this goal. In our approach, the UML Class diagram formalism is used to define a meta-model of LRN. The meta-modeling tool ATOM3 is used to generate a visual modeling tool according to the proposed LRN meta-model. To generate R-Maude specification of the graphically specified LRN models, we have proposed a graph grammar. Then the reconfigurable rewriting logic language R-Maude can be used to perform the simulation of the resulted R-Maude specification. Our approach is illustrated through examples.

Published in:

Information Technology and e-Services (ICITeS), 2012 International Conference on

Date of Conference:

24-26 March 2012