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 |
| Language: | English English |
| Published: |
AIP Publishing
2014
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/37013/ http://irep.iium.edu.my/37013/ http://irep.iium.edu.my/37013/ http://irep.iium.edu.my/37013/6/37013-Watson-Crick%20Petri%20Net%20Languages%20with%20Finite%20sets.pdf http://irep.iium.edu.my/37013/5/37013-Watson-Crick%20Petri%20Net%20Languages%20with%20Finite_SCOPUS.pdf |
| Summary: | 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. |
|---|