Languages of Watson-Crick Petri Net

Authors

  • Nurhidaya Mohamad Jan Department of Mathematical Sciences, Faculty of Sciences, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor, Malaysia
  • Fong Wan Heng Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor, Malaysia
  • Nor Haniza Sarmin Department of Mathematical Sciences, Faculty of Sciences, Universiti Teknologi Malaysia, 81310 UTM Johor Bahru, Johor, Malaysia
  • Sherzod Turaev Department of Computer Science, Kulliyah of Information and Communication Technology, International Islamic University Malaysia, 53100 Kuala Lumpur, Malaysia

DOI:

https://doi.org/10.11113/jt.v70.3521

Keywords:

Automata, Watson-Crick, Petri net

Abstract

Watson-Crick automata are one of the automata types that are used for transitions with two reading heads. This automata work on double stranded sequencesrelated 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 labelling policies and finite sets of final markings.

References

D. Freifelder. 1978. The DNA Molecule Structure and Properties. United States of America: W. H. Freeman and Company.

L. Kari, G. Paun, G. Rozenberg, A. Salomaa and S. Yu. 1998. Acta Informatica. 35: 401.

J. L. Peterson. 1976. Journal Computer and System Sciences. 13: 1.

G. Paun, G. Rozenberg, and A. Salomaa. 1998. DNA Computing: New Computing Paradigms. Germany: Springer-Verlag Berlin Heidelberg New York.

E. Czeizler and E. Czeizler. 2006. Bull. EATCS. 356: 190.

R. Freund, G. Paun, G. Rozenberg and A. Salomaa. 1997. Proceeding 3rd DIMACS Workshop on DNA Based Computers. 297.

S. Turaev. 2010. Petri Net Controlled Grammars. Ph.D. Thesis. Universitat Rovira I Virgili.

J. L. Peterson. 1977. Journal Computer and System Sciences. 9: 223.

H. Yen. 2006. Studies in Computational Intelligence (SCI). 25: 343.

Downloads

Published

2014-09-18

Issue

Vol. 70 No. 5: Special Issue in Science and Technology

Section

Science and Engineering

License

Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.

How to Cite

Languages of Watson-Crick Petri Net. (2014). Jurnal Teknologi (Sciences & Engineering), 70(5). https://doi.org/10.11113/jt.v70.3521