| Budget Amount *help |
¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Research Abstract |
Bidirectional graph transformation has been considered to be a promising approach to propagating modifications bidirectionally over transformations that are used as model transformations in model-driven engineering. We have strengthened our previous approach based on structural recursions on regular trees.
We have introduced orders between outgoing edges of nodes, which, as far as we know, had not been realized so far. We have successfully introduced the order for forward transformations, extended the expressive power, and implemented a prototype by embedding into lambda calculi. As for the performance issue, we have clarified the cases in which we can normalize the transformation and eliminate intermediate results. Applications we have investigated include collaborative development of models in systems biology.
|
