TY - GEN
T1 - Closure properties of Watson-Crick Petri net
AU - Jan, Nurhidaya Mohamad
AU - Heng, Fong Wan
AU - Sarmin, Nor Haniza
AU - Turaev, Sherzod
N1 - Funding Information:
The first author would like to thank UTM for the UTM Zamalah Scholarship. The second author and third authors would also like to thank the Ministry of Higher Education (MOHE) and Research Management Centre (RMC), Universiti Teknologi Malaysia (UTM) for the financial funding through Research University Grant Vote No. 13H18. Also, the fourth author would like to thank MOHE and International Islamic University Malaysia (IIUM) for the financial funding through IIUM Research Initiative Grant Scheme RIGS16-368-0532.
Publisher Copyright:
© 2018 Author(s).
PY - 2018/6/28
Y1 - 2018/6/28
N2 - A Watson-Crick Petri net is a model that enhances a Petri net with the Watson-Crick complementarity feature adapted from DNA molecules. The transitions of a Watson-Crick Petri net are labelled 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 symbols. In this research, the closure properties of Watson-Crick Petri net are determined under several operations such as concatenation, union, intersection and concurrent composition. Some new definitions of the closure properties are defined. Also, the generative power of Watson-Crick Petri net languages under the closure properties are discussed by some examples and theorems. It is shown that the family of Watson-Crick Petri net languages is closed under concatenation, union, intersection and concurrent composition.
AB - A Watson-Crick Petri net is a model that enhances a Petri net with the Watson-Crick complementarity feature adapted from DNA molecules. The transitions of a Watson-Crick Petri net are labelled 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 symbols. In this research, the closure properties of Watson-Crick Petri net are determined under several operations such as concatenation, union, intersection and concurrent composition. Some new definitions of the closure properties are defined. Also, the generative power of Watson-Crick Petri net languages under the closure properties are discussed by some examples and theorems. It is shown that the family of Watson-Crick Petri net languages is closed under concatenation, union, intersection and concurrent composition.
KW - Closure properties
KW - Language
KW - Petri net
KW - Watson-Crick
UR - http://www.scopus.com/inward/record.url?scp=85049782926&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85049782926&partnerID=8YFLogxK
U2 - 10.1063/1.5041659
DO - 10.1063/1.5041659
M3 - Conference contribution
AN - SCOPUS:85049782926
T3 - AIP Conference Proceedings
BT - Proceeding of the 25th National Symposium on Mathematical Sciences, SKSM 2017
A2 - Maidinsah, Hamidah
A2 - Sharif, Sarifah Radiah
A2 - Rahman, Wan Eny Zarina Wan Abdul
A2 - Akbarally, Ajab Bai
A2 - Mohamed, Mesliza
A2 - Mohamad, Daud
A2 - Jaffar, Maheran Mohd
PB - American Institute of Physics Inc.
T2 - 25th National Symposium on Mathematical Sciences: Mathematical Sciences as the Core of Intellectual Excellence, SKSM 2017
Y2 - 27 August 2017 through 29 August 2017
ER -