Watson-Crick Petri net languages with finite sets of final markings

Mohamad Jan, Nurhidaya and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2014) Watson-Crick Petri net languages with finite sets of final markings. In: 3rd International Conference on Mathematical Sciences, 17th-19th December 2013, Kuala Lumpur, Malaysia.

	PDF - Published Version Restricted to Repository staff only Download (290kB) | Request a copy
	PDF (SCOPUS) - Supplemental Material Restricted to Repository staff only Download (79kB) | Request a copy

Abstract

A Watson-Crick Petri net is a new formal model that enhances a Petri net with the Watson-Crick complementary feature adapted from DNA molecules. The transitions of a Watson-Crick Petri net are labeled with pairs of symbols, and a firing sequence of transitions of the Watson-Crick Petri net is considered as successful if and only if it produces complete double stranded sequences of symmetrically related symbols according to some mode of execution termination of the firing of transitions. As an execution termination mode, we can consider the set of all reachable markings and a finite set of final markings. In this research, we investigate the fundamental properties of Watson-Crick Petri net languages with finite sets of final markings.

Item Type:	Conference or Workshop Item (Plenary Papers)
Additional Information:	6846/37013
Uncontrolled Keywords:	DNA, Petri net, Watson-Crick automata, language
Subjects:	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:	25 Jun 2014 10:03
Last Modified:	12 Sep 2017 12:21
URI:	http://irep.iium.edu.my/id/eprint/37013

Actions (login required)

View Item