Publication
Title
Programmed graph rewriting with DEVS
Author
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.
Language
English
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Publication
Berlin : 2008
ISSN
0302-9743 [print]
1611-3349 [online]
Volume/pages
5088(2008), p. 136-151
ISI
000262477700011
Full text (Publisher's DOI)
UAntwerpen
Faculty/Department
Publication type
Subject
External links
Web of Science
Record
Identification
Creation 03.06.2013
Last edited 21.06.2017