@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00216197,
 author = {Yuki, Hirano and Nobuhiko, Ogura and Yuki, Hirano and Nobuhiko, Ogura},
 book = {Proceedings of Asia Pacific Conference on Robot IoT System Development and Platform},
 month = {Jan},
 note = {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., 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.},
 pages = {98--99},
 publisher = {情報処理学会},
 title = {A Representation of Tree Matching and Rewriting for Model Transformation},
 volume = {2021},
 year = {2022}
}