Abstract
Logical Petri Nets (LPNs) can well describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. Their structures are simpler than the equivalent inhibition Petri nets. To analyze them, a vector matching method has been given. In this paper a subclass of LPNs is proposed and its properties are analyzed. It can be used to model and simulate e-commerce systems well. Its special structures and relationships among its logical transitions are discussed. Based on them, a reachability tree is constructed and the state equations are used to analyze its properties, that is, reachability, liveness, conservativeness, and reversibility. The proposed analysis method significantly lowers the computational efforts in comparison with the existing method for LPNs.
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
