Mohamad Jan, Nurhidaya and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2014) Languages of watson-crick petri net. Jurnal Teknologi, 70 (5). pp. 97-101. ISSN 0127–9696 E-ISSN 2180–3722
PDF
Restricted to Repository staff only Download (909kB) | Request a copy |
|
PDF (SCOPUS)
- Published Version
Restricted to Repository staff only Download (66kB) | Request a copy |
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 labeling policies and finite sets of final markings.
Item Type: | Article (Journal) |
---|---|
Additional Information: | 6846/39720 |
Uncontrolled Keywords: | Automata; Watson-Crick; Petri net |
Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button): | Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science |
Depositing User: | Dr. Sherzod Turaev |
Date Deposited: | 15 Dec 2014 15:05 |
Last Modified: | 07 Sep 2017 09:49 |
URI: | http://irep.iium.edu.my/id/eprint/39720 |
Actions (login required)
View Item |