Universiti Teknologi Malaysia Institutional Repository

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. AIP Conference Proceedings, 1602 . pp. 876-880. ISSN 0094-243X

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1063/1.4882587

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:Article
Uncontrolled Keywords:language, set theory
Subjects:Q Science
Divisions:Science
ID Code:63231
Deposited By: Siti Nor Hashidah Zakaria
Deposited On:18 Jun 2017 15:14
Last Modified:18 Jun 2017 15:14

Repository Staff Only: item control page