Watson-crick partial petri net languages and their properties
摘要
This paper introduces a Watson-Crick Partial Petri Net, an improved model that uses Watson-Crick complementarity. This model analyzes paired reads as double-stranded symbol sequences, one at a time. The study deals with the partial languages generated by the Watson-Crick Partial Petri Net and examines their closure properties to validate, verify and synthesize indeterminate distributed nets.