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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2013
|
| Subjects: |
| _version_ | 1796861588151468032 |
|---|---|
| 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 |
| collection | ePrints |
| 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. |
| first_indexed | 2024-03-05T19:58:41Z |
| format | Conference or Workshop Item |
| id | utm.eprints-67170 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T19:58:41Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | utm.eprints-671702017-06-18T07:16:30Z http://eprints.utm.my/67170/ Watson-Crick Petri net languages with finite sets of final markings Mohamad Jan, Nurhidaya Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Q Science (General) 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. 2013 Conference or Workshop Item PeerReviewed Mohamad Jan, Nurhidaya and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Watson-Crick Petri net languages with finite sets of final markings. In: 3rd International Conference on Mathematical Sciences, ICMS 2013, 17-19 Dec, 2013, Kuala Lumpur, Malaysia. http://dx.doi.org/10.1063/1.4882587 |
| spellingShingle | Q Science (General) Mohamad Jan, Nurhidaya Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Watson-Crick Petri net languages with finite sets of final markings |
| title | 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_short | Watson-Crick Petri net languages with finite sets of final markings |
| title_sort | watson crick petri net languages with finite sets of final markings |
| topic | Q Science (General) |
| work_keys_str_mv | AT mohamadjannurhidaya watsoncrickpetrinetlanguageswithfinitesetsoffinalmarkings AT fongwanheng watsoncrickpetrinetlanguageswithfinitesetsoffinalmarkings AT sarminnorhaniza watsoncrickpetrinetlanguageswithfinitesetsoffinalmarkings AT turaevsherzod watsoncrickpetrinetlanguageswithfinitesetsoffinalmarkings |