Partial Petri Net Languages and their Properties
摘要
The languages derived from Petri Net provides a efficient technique for verification, validation and synthesis for the system. Partial words are extensively used in the fields such as bioinformatics, pattern matching and text searching. In this paper, we introduce a Partial Petri Net and then define its associated languages. Further, we discuss the closure properties that hold over these derived languages.