The Routed DEVS (RDEVS) formalism provides a formalization for routing process simulation. This paper presents the mapping between constrained network models obtained from textual specifications of routing processes and RDEVS simulation models implemented in Java. The proposal is part of a work-in-progress intended to develop M&S software tools for the RDEVS formalism using well-known abstractions to get the computational models attached to such abstraction models through conceptual mapping. Then, modelers can have simulation models without needing to codify any routing implementation. Benefits are i) reduction of implementation times and ii) simulation model correctness regarding the RDEVS formalism.

The Routed DEVS (RDEVS) formalism provides a reasonable formalization for the simulation of routing processes. In this paper, we introduce a context-free grammar for the definition of routing processes as a particular case of a constrained network model. Such grammar is based on a metamodel that defines the semantics over the syntactical elements. This metamodel allows a direct mapping between its concepts and RDEVS simulation models. A Java implementation is provided for the grammar as a plug-in for Eclipse IDE. The main benefit of this software tool is the feasibility of getting a simulation model without having programming skills.