Issue No. 04 - April (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.219756
<p>Petri nets (PNs) are frequently used in modeling, designing, and analyzing concurrentsystems. A problem with PNs, in the general case, is that they require high computationalcomplexity to analyze their properties, such as reachability, liveness, and boundedness.To avoid this problem, synthesis techniques for constructing large PNs are presented.Using these techniques, the behavior of the constructed PN can be determined by localanalysis that uses known properties of the given nets. Thus, the high computationalcomplexity of global analysis is bypassed. A synthesis technique that exploresdependency relations in PNs is presented. It synthesizes large PNs by combining smallerPNs of arbitrary topology structures, and the combination is verified efficiently bydependency analysis. A large system based on a PN can be built up by repeatedapplications of the technique.</p>
Index TermsPetri nets; concurrent systems; computational complexity; reachability; liveness;boundedness; dependency relations; computational complexity; parallel processing; Petrinets
W. Tsai, D. Chao and Y. Chen, "Dependency Analysis-A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 414-426, 1993.