Abstract
On the foundation of basic Petri net theory, the paper proposes the definitions of Inverse Petri Nets, discusses the relations of inverse petri nets and its original petri nets, proves the theorem of transition enablity and the full - ref lection theorem, and outlines the applications of inverse petri nets. We find that the inverse Petri nets are a promising tool for deeling with some application problems. Using the concept of inverse Petri nets and analysis methodology of reachability, it is easy to solve the design problems of initial state and input sequences in discrete event control systems. The concept of inverse Petri nets is meaningful for constructing the Petri net models of describing logic proof problems.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
