Languages of Watson-Crick Petri net

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

doi:10.11113/jt.v70.3521

Languages of Watson-Crick Petri net

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

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	97-101
Number of pages	5
Journal	Jurnal Teknologi (Sciences and Engineering)
Volume	70
Issue number	5
DOIs	https://doi.org/10.11113/jt.v70.3521
Publication status	Published - 2014
Externally published	Yes

Keywords

Automata
Petri net
Watson-Crick

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.11113/jt.v70.3521

Cite this

@article{f0361a16c1ae4ec381b3a8873146773e,

title = "Languages of 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 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.",

keywords = "Automata, Petri net, Watson-Crick",

author = "Jan, {Nurhidaya Mohamad} and Heng, {Fong Wan} and Sarmin, {Nor Haniza} and Sherzod Turaev",

year = "2014",

doi = "10.11113/jt.v70.3521",

language = "English",

volume = "70",

pages = "97--101",

journal = "Jurnal Teknologi (Sciences and Engineering)",

issn = "0127-9696",

publisher = "Penerbit Universiti Teknologi Malaysia",

number = "5",

}

TY - JOUR

T1 - Languages of Watson-Crick Petri net

AU - Jan, Nurhidaya Mohamad

AU - Heng, Fong Wan

AU - Sarmin, Nor Haniza

AU - Turaev, Sherzod

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Automata

KW - Petri net

KW - Watson-Crick

UR - http://www.scopus.com/inward/record.url?scp=84907291980&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907291980&partnerID=8YFLogxK

U2 - 10.11113/jt.v70.3521

DO - 10.11113/jt.v70.3521

M3 - Article

AN - SCOPUS:84907291980

SN - 0127-9696

VL - 70

SP - 97

EP - 101

JO - Jurnal Teknologi (Sciences and Engineering)

JF - Jurnal Teknologi (Sciences and Engineering)

IS - 5

ER -

Languages of Watson-Crick Petri net

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this