Domain-specific discrete event modelling and simulation using graph transformation

Abstract

El acceso a la versión del editor puede requerir la suscripción del recurso Access to the published version may require subscription Abstract Graph transformation is being increasingly used to express the semantics of domain specific visual languages since its graphical nature makes rules intuitive. However, many application domains require an explicit handling of time to accurately represent the behaviour of a real system and to obtain useful simulation metrics in order to measure throughputs, utilization times and average delays. Inspired by the vast knowledge and experience accumulated by the discrete event simulation community, we propose a novel way of adding explicit time to graph transformation rules. In particular, we take the event scheduling discrete simulation world view and provide rules with the ability to schedule the occurrence of other rules in the future. Hence, our work combines standard, efficient techniques for discrete event simulation (based on the handling of a future event set) and the intuitive, visual nature of graph transformation. Moreover, we show how our formalism can be used to give semantics to other timed approaches and provide an implementation on top of the rewriting logic system Maude.

A Strategic Graph Rewriting Model of Rational Negligence in Financial Markets

“…Graph Transformation Systems (GTSs) have been used as a modelling framework in many areas: for example, RuleBENDER 2 is a simulation tool that supports rulebased modelling of biochemical systems [30], Kappa [23] is a rule-based language for modelling protein interaction networks, graph transformation has also been used to outline the semantics of domain specific modelling languages [8].…”

“…Rewrite rules are an intuitive and natural way of expressing dynamic, structural changes which are generally more difficult to model in traditional simulation approaches where the structure of the model is usually fixed [8]. Graph rewriting languages are well-suited to the study of the dynamic behaviour of complex systems: their declarative nature and visual aspects facilitate the analysis of the processes of interest producing a shorter distance between mental picture and implementation; they can be used for rapid prototyping, to run system simulations, and, thanks to their formal semantics, also to reason about system properties.…”

Statistical Model Checking of e-Motions Domain-Specific Modeling Languages

“…Based on ideas from Event Scheduling, de Lara et al propose in [12] an interesting way of adding explicit time to graph transformation rules by scheduling rules in the future. Basically, they schedule all possible matches of rules (what they call events) and proceed by handling each of these events.…”

Implementation of a Port-graph Model for Finance

“…In addition, over extant approaches, the rewrite rules that drive graph transformation systems are an intuitive and natural way of expressing dynamic, structural changes which are generally more difficult to model using traditional simulation approaches where the structure of the model is usually fixed [5]. Over many of the declarative languages used within agent-based simulation tools, this approach, given its visual declarative nature, provides more conceptualization support.…”