Home
>
Explore Content
>
All Issues
>
Article View
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 : Computer Science
2009, 14(1), pp.173-181
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
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.
126
Viewed
Print this page
Download PDF