Programmed Graph Rewriting with DEVS
| 详细信息 | 推荐本文 | |
- 作者：Eugene Syriani ; Hans Vangheluwe
- 刊名：Lecture Notes in Computer Science
- 出版时间：2008
- 出版年：2008
- 期刊代码：99_0302-9743
- 类别：cp
- 卷：5088
- 期：1
- 页码：136-151
- 数据来源：sp
摘要
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.