Composition of Logical Petri Nets and Compatibility Analysis

Logical Petri nets (LPNs) can well describe and analyze batch processing functions and pass the value indeterminacy in cooperative systems. Their structure is simpler than their equivalent inhibition PNs. To analyze them, a vector matching method was given previously. We present interactive LPNs (ILPNs) in this paper. Their liveness and boundedness are analyzed for the first time. Compatibility is analyzed for a composed system and reflects the possibility of correct/proper interactions among its subsystems. To characterize different cooperative abilities in practice, compatibility is defined for ILPNs. Some relationships among compatibility, liveness, boundedness, and conservativeness are revealed. An example is presented to discuss the effectiveness of the proposed method.