TGG based automatic transformation between SBML and other biological modeling languages

Shijia Zhu, Yadong Wang, Chunguang Ji, Haijun Tao

Research output: Contribution to journalArticle

Abstract

XSLT based transformation, between SBML and other biological modeling languages, cannot describe comprehensive context-sensitive semantic correspondences among the inner elements of biological modeling objects; cannot guarantee the determinacy and syntactic correctness of transformation results; and also cannot meet industrial transformation requirements. Toward these problems, a triple graph grammar (TGG) based transformation method is presented, which utilizes graph grammars to define SBML schema and other biological modeling languages, and utilizes TGG to construct transformation between them. On this basis, a transformation algorithm is presented, which has polynomial time complexity and can guarantee determinacy and syntactic correctness. Compared with the traditional transformation between SBML and other biological modeling languages, the method in this paper has the following characteristics: 1) It utilizes context-sensitive grammar and has strong description capability; 2) It imposes graph-based approach to simplify transformation definition process; 3) It only needs static analysis of transformation rules at the design time without exploring dynamic analysis, because validation must be achieved if transformation rules satisfy some constraints; 4) It only requires to change direction of transformation rules to implement bi-directional transformation, without modifying any element; and 5) It supports incremental change propagation, since it preserves the correspondence information between source and target objects. Finally, correctness and effectiveness of this method are verified through an example of transformation between Petri net and SBML.

Original languageEnglish (US)
Pages (from-to)885-896
Number of pages12
JournalJisuanji Yanjiu yu Fazhan/Computer Research and Development
Volume48
Issue number5
StatePublished - May 1 2011
Externally publishedYes

Fingerprint

Syntactics
Context sensitive grammars
Static analysis
Petri nets
Dynamic analysis
Semantics
Polynomials
Modeling languages

Keywords

  • Graph grammar
  • Model transformation
  • SBML
  • TGG
  • XML

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

TGG based automatic transformation between SBML and other biological modeling languages. / Zhu, Shijia; Wang, Yadong; Ji, Chunguang; Tao, Haijun.

In: Jisuanji Yanjiu yu Fazhan/Computer Research and Development, Vol. 48, No. 5, 01.05.2011, p. 885-896.

Research output: Contribution to journalArticle

@article{182630b109044e5e9000876dea1d9ba7,
title = "TGG based automatic transformation between SBML and other biological modeling languages",
abstract = "XSLT based transformation, between SBML and other biological modeling languages, cannot describe comprehensive context-sensitive semantic correspondences among the inner elements of biological modeling objects; cannot guarantee the determinacy and syntactic correctness of transformation results; and also cannot meet industrial transformation requirements. Toward these problems, a triple graph grammar (TGG) based transformation method is presented, which utilizes graph grammars to define SBML schema and other biological modeling languages, and utilizes TGG to construct transformation between them. On this basis, a transformation algorithm is presented, which has polynomial time complexity and can guarantee determinacy and syntactic correctness. Compared with the traditional transformation between SBML and other biological modeling languages, the method in this paper has the following characteristics: 1) It utilizes context-sensitive grammar and has strong description capability; 2) It imposes graph-based approach to simplify transformation definition process; 3) It only needs static analysis of transformation rules at the design time without exploring dynamic analysis, because validation must be achieved if transformation rules satisfy some constraints; 4) It only requires to change direction of transformation rules to implement bi-directional transformation, without modifying any element; and 5) It supports incremental change propagation, since it preserves the correspondence information between source and target objects. Finally, correctness and effectiveness of this method are verified through an example of transformation between Petri net and SBML.",
keywords = "Graph grammar, Model transformation, SBML, TGG, XML",
author = "Shijia Zhu and Yadong Wang and Chunguang Ji and Haijun Tao",
year = "2011",
month = "5",
day = "1",
language = "English (US)",
volume = "48",
pages = "885--896",
journal = "Jisuanji Yanjiu yu Fazhan/Computer Research and Development",
issn = "1000-1239",
publisher = "Science Press",
number = "5",

}

TY - JOUR

T1 - TGG based automatic transformation between SBML and other biological modeling languages

AU - Zhu, Shijia

AU - Wang, Yadong

AU - Ji, Chunguang

AU - Tao, Haijun

PY - 2011/5/1

Y1 - 2011/5/1

N2 - XSLT based transformation, between SBML and other biological modeling languages, cannot describe comprehensive context-sensitive semantic correspondences among the inner elements of biological modeling objects; cannot guarantee the determinacy and syntactic correctness of transformation results; and also cannot meet industrial transformation requirements. Toward these problems, a triple graph grammar (TGG) based transformation method is presented, which utilizes graph grammars to define SBML schema and other biological modeling languages, and utilizes TGG to construct transformation between them. On this basis, a transformation algorithm is presented, which has polynomial time complexity and can guarantee determinacy and syntactic correctness. Compared with the traditional transformation between SBML and other biological modeling languages, the method in this paper has the following characteristics: 1) It utilizes context-sensitive grammar and has strong description capability; 2) It imposes graph-based approach to simplify transformation definition process; 3) It only needs static analysis of transformation rules at the design time without exploring dynamic analysis, because validation must be achieved if transformation rules satisfy some constraints; 4) It only requires to change direction of transformation rules to implement bi-directional transformation, without modifying any element; and 5) It supports incremental change propagation, since it preserves the correspondence information between source and target objects. Finally, correctness and effectiveness of this method are verified through an example of transformation between Petri net and SBML.

AB - XSLT based transformation, between SBML and other biological modeling languages, cannot describe comprehensive context-sensitive semantic correspondences among the inner elements of biological modeling objects; cannot guarantee the determinacy and syntactic correctness of transformation results; and also cannot meet industrial transformation requirements. Toward these problems, a triple graph grammar (TGG) based transformation method is presented, which utilizes graph grammars to define SBML schema and other biological modeling languages, and utilizes TGG to construct transformation between them. On this basis, a transformation algorithm is presented, which has polynomial time complexity and can guarantee determinacy and syntactic correctness. Compared with the traditional transformation between SBML and other biological modeling languages, the method in this paper has the following characteristics: 1) It utilizes context-sensitive grammar and has strong description capability; 2) It imposes graph-based approach to simplify transformation definition process; 3) It only needs static analysis of transformation rules at the design time without exploring dynamic analysis, because validation must be achieved if transformation rules satisfy some constraints; 4) It only requires to change direction of transformation rules to implement bi-directional transformation, without modifying any element; and 5) It supports incremental change propagation, since it preserves the correspondence information between source and target objects. Finally, correctness and effectiveness of this method are verified through an example of transformation between Petri net and SBML.

KW - Graph grammar

KW - Model transformation

KW - SBML

KW - TGG

KW - XML

UR - http://www.scopus.com/inward/record.url?scp=79959582404&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959582404&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:79959582404

VL - 48

SP - 885

EP - 896

JO - Jisuanji Yanjiu yu Fazhan/Computer Research and Development

JF - Jisuanji Yanjiu yu Fazhan/Computer Research and Development

SN - 1000-1239

IS - 5

ER -