Citation
Hans Vangheluwe. "Modular Timed Graph Transformation". Talk or presentation, 6, August, 2008.

Abstract
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 with DEVS. We show how the use of DEVS allows for modular modification of control structure and ultimately allows real-time simulation/execution.

Electronic downloads

• presentationCHESS.pdf · application/pdf · 2685 kbytes

• HTML

  Hans Vangheluwe. <a
  href="http://chess.eecs.berkeley.edu/pubs/481.html"
  ><i>Modular Timed Graph
  Transformation</i></a>, Talk or presentation, 
  6, August, 2008.

• Plain text

  Hans Vangheluwe. "Modular Timed Graph
  Transformation". Talk or presentation,  6, August, 2008.

• BibTeX

  @presentation{Vangheluwe08_ModularTimedGraphTransformation,
      author = {Hans Vangheluwe},
      title = {Modular Timed Graph Transformation},
      day = {6},
      month = {August},
      year = {2008},
      abstract = {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 with DEVS. We show how the use of DEVS
                allows for modular modification of control
                structure and ultimately allows real-time
                simulation/execution. },
      URL = {http://chess.eecs.berkeley.edu/pubs/481.html}
  }
  

Posted by Hiren Patel on 7 Aug 2008.
Groups: chess
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.