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

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

Full description

Saved in:
Bibliographic Details
Main Authors: Mohamad Jan, Nurhidaya, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format: Article
Published: American Institute of Physics Inc. 2014
Subjects:
Online Access:http://eprints.utm.my/id/eprint/63231/
http://dx.doi.org/10.1063/1.4882587
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.63231
record_format eprints
spelling my.utm.632312017-06-18T07:14:38Z http://eprints.utm.my/id/eprint/63231/ Watson-Crick Petri net languages with finite sets of final markings Mohamad Jan, Nurhidaya Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Q Science 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. American Institute of Physics Inc. 2014 Article PeerReviewed 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 http://dx.doi.org/10.1063/1.4882587 DOI :10.1063/1.4882587
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic Q Science
spellingShingle Q Science
Mohamad Jan, Nurhidaya
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
Watson-Crick Petri net languages with finite sets of final markings
description 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.
format Article
author Mohamad Jan, Nurhidaya
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
author_facet Mohamad Jan, Nurhidaya
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
author_sort Mohamad Jan, Nurhidaya
title Watson-Crick Petri net languages with finite sets of final markings
title_short Watson-Crick Petri net languages with finite sets of final markings
title_full Watson-Crick Petri net languages with finite sets of final markings
title_fullStr Watson-Crick Petri net languages with finite sets of final markings
title_full_unstemmed Watson-Crick Petri net languages with finite sets of final markings
title_sort watson-crick petri net languages with finite sets of final markings
publisher American Institute of Physics Inc.
publishDate 2014
url http://eprints.utm.my/id/eprint/63231/
http://dx.doi.org/10.1063/1.4882587
_version_ 1643655658213474304
score 13.160551