Watson-Crick Petri net languages: the effect of labeling strategies

• Main Authors: Fong, Wan Heng, Mohamad Jan, Nurhidaya, Sarmin, Nor Haniza, Turaev, Sherzod
• Format: Conference or Workshop Item
• Published: 2013
• Subjects: Q Science (General)
• Online Access: http://eprints.utm.my/id/eprint/67164/; http://dx.doi.org/10.1063/1.4887673

A Watson-Crick automaton is an automaton that works on tapes which are double stranded sequences of symbols related by Watson-Crick complementarity that are similar to the DNA molecules. However, this automaton cannot exploit the other fundamental features of DNA molecules such as the massive parallelism. Watson-Crick automata can be related to a model known as the Petri net. Petri net is a model based on the concepts of asynchronous and concurrent operation by the parts of a system and the realization by the parts can be represented by a graph or a net. From the relation between Watson-Crick automata and Petri net, a new model namely Watson-Crick Petri net has been developed. The language generated by Watson-Crick Petri net is a set of labeled sequences corresponding to the occurrence sequences of the model. In this research, some properties of languages generated by Watson-Crick Petri net are investigated.