z-logo
open-access-imgOpen Access
Modeling Routing Processes through Network Theory: A Grammar to Define RDEVS Simulation Models
Author(s) -
María Julia Blas,
Clarisa Espertino,
Silvio Gonnet
Publication year - 2021
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5753/mssis.2021.17255
Subject(s) - computer science , metamodeling , programming language , grammar , devs , formalism (music) , distributed computing , theoretical computer science , software engineering , modeling and simulation , simulation , art , musical , philosophy , linguistics , visual arts
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here