본문 바로가기
  • Home

An Algorithm to Transform RDF Models into Colored Petri Nets

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2009, 14(1), pp.173-181
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

YIM JAE GEOL 1 권기용 1 Joo, Jaehun 1 이강재 2

1동국대학교
2수원과학대학

Accredited

ABSTRACT

This paper proposes an algorithm to transform RDF(Resource Description Framework) models for ontology into CPN(Colored Petri Net) models. The algorithm transforms the semantics of the RDF model into the topology of the CPN by mapping the classes and the properties of the RDF onto the places of the CPN model then reflects the RDF statements on the CPN by representing the relationships between them as token transitions on the CPN. The basic idea of reflecting the RDF statements on the CPN is to generate a token, which is an ordered pair consisting of two tokens (one from the place mapped into the subject and the other one from the place mapped into the object) and transfer it to the place mapped into the predicate. We have actually built CPN models for given RDF models on the CNPTools and inferred and extracted answers to the RDF queries on the CPNTools.

Citation status

* References for papers published after 2022 are currently being built.

This paper was written with support from the National Research Foundation of Korea.