Abstract
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short review of existing programmed graph rewriting systems, listing the control structures they provide. As DEVS is a timed, highly modular, hierarchical formalism for the description of reactive systems, control structures such as sequence, choice, and iteration are easily modelled. Non-determinism and parallel composition also follow from DEVS' semantics. The proposed approach is illustrated through the modelling of a simple PacMan game, first in AToM3 and then using DEVS. We show how the use of DEVS allows for modular modification of control structure. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Syriani, E., & Vangheluwe, H. (2008). Programmed graph rewriting with DEVS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5088 LNCS, pp. 136–151). Springer Verlag. https://doi.org/10.1007/978-3-540-89020-1_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
