Languages of Watson-Crick Petri net

Nurhidaya Mohamad Jan, Fong Wan Heng, Nor Haniza Sarmin, Sherzod Turaev

Research output: Contribution to journalArticlepeer-review

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 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 labelling policies and finite sets of final markings.

Original languageEnglish
Pages (from-to)97-101
Number of pages5
JournalJurnal Teknologi (Sciences and Engineering)
Volume70
Issue number5
DOIs
Publication statusPublished - 2014
Externally publishedYes

Keywords

  • Automata
  • Petri net
  • Watson-Crick

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Languages of Watson-Crick Petri net'. Together they form a unique fingerprint.

Cite this