Languages of watson-crick petri net
Watson-Crick automata are one of the automata types that are used for transitions with two reading heads. This automata work on double stranded sequences related by a complementarity relation similar with the Watson-Crick complementarity of DNA molecules. Watson-Crick automata can be related to a Pe...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Universiti Teknologi Malaysia
2014
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/39720/ http://irep.iium.edu.my/39720/ http://irep.iium.edu.my/39720/1/Languages_of_Watson-Crick_Petri_Nets_Jurnal_Teknologi_70%285%29_2014%2C_pp_97-101.pdf http://irep.iium.edu.my/39720/4/39720_Languages%20of%20watson-crick%20petri%20net_SCOPUS.pdf |
| Summary: | Watson-Crick automata are one of the automata types that are used for transitions with two reading heads. This automata work on double stranded sequences related by a complementarity relation similar with the Watson-Crick complementarity of DNA molecules. Watson-Crick automata can be related to a Petri net, which is a graphical and mathematical formalism suitable for the modeling and analysis of concurrent, asynchronous and distributed systems. From the relation between Watson-Crick automata and Petri net, a new model namely Watson-Crick Petri net has been developed. In this paper, a new variant of Watson-Crick automata with Petri net as a control unit is introduced. We also presented various types of Watson-Crick Petri nets that are generated using transitions labelled with various labeling policies and finite sets of final markings. |
|---|