| Item type |
Symposium(1) |
| 公開日 |
2022-01-28 |
| タイトル |
|
|
タイトル |
A Representation of Tree Matching and Rewriting for Model Transformation |
| タイトル |
|
|
言語 |
en |
|
タイトル |
A Representation of Tree Matching and Rewriting for Model Transformation |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_5794 |
|
資源タイプ |
conference paper |
| 著者所属 |
|
|
|
Tokyo City University Yokohama Campus |
| 著者所属 |
|
|
|
Tokyo City University Yokohama Campus |
| 著者所属(英) |
|
|
|
en |
|
|
Tokyo City University Yokohama Campus |
| 著者所属(英) |
|
|
|
en |
|
|
Tokyo City University Yokohama Campus |
| 著者名 |
Yuki, Hirano
Nobuhiko, Ogura
|
| 著者名(英) |
Yuki, Hirano
Nobuhiko, Ogura
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
This study proposes a simple representation of tree processing for model transformation. System development with model transformation often processes the definition part of behavior and scope in the model. Even though models are typically represented by graphs, in such cases , tree processing is required. However, the notation of tree processing tends to be complicated because of the problem that recursion and complex conditional branching are required. To reduce such difficulty, we propose a simplified representation of tree bonding, constructing and matching for model transformation. With these attempts, tree processing can be written in short notation like processing to other data structures such as strings or lists. Also, that improves the efficiency and maintainability of model transformation. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
This study proposes a simple representation of tree processing for model transformation. System development with model transformation often processes the definition part of behavior and scope in the model. Even though models are typically represented by graphs, in such cases , tree processing is required. However, the notation of tree processing tends to be complicated because of the problem that recursion and complex conditional branching are required. To reduce such difficulty, we propose a simplified representation of tree bonding, constructing and matching for model transformation. With these attempts, tree processing can be written in short notation like processing to other data structures such as strings or lists. Also, that improves the efficiency and maintainability of model transformation. |
| 書誌情報 |
Proceedings of Asia Pacific Conference on Robot IoT System Development and Platform
巻 2021,
p. 98-99,
発行日 2022-01-28
|
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-APRIS2021021.pdf (1.4 MB)
