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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings of the 3rd International Conference on Mathematical Sciences, ICMS 2013
PublisherAmerican Institute of Physics Inc.
Pages876-880
Number of pages5
ISBN (Print)9780735412361
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event3rd International Conference on Mathematical Sciences, ICMS 2013 - Kuala Lumpur, Malaysia
Duration: Dec 17 2013Dec 19 2013

Publication series

NameAIP Conference Proceedings
Volume1602
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference3rd International Conference on Mathematical Sciences, ICMS 2013
Country/TerritoryMalaysia
CityKuala Lumpur
Period12/17/1312/19/13

Keywords

  • DNA
  • language
  • Petri net
  • Watson-Crick automata

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint

Dive into the research topics of 'Watson-Crick Petri net languages with finite sets of final markings'. Together they form a unique fingerprint.

Cite this