Algorithm for Constructing Petri Net Based on Language Expression
To create a Petri net that the language it produced is equal to a given language express is an important problem in the Petri nets language theory.The relationships between the language operations of synchronization alternate regular expression and the Petri nets compositions are analyzed.The transformation methods that the regular expression and the α-closure expression is created a Petri net are given.The bounded cover composition operation for Petri net is defined and the language properties about bounded cover composition Petri net is researched.The algorithm for constructing Petri net based on language expression is given.It is realized that to create a Petri net that the language it produced is equal to a given language expression.