
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Y. Chen, W.T. Tsai, D. Chao, "Dependency AnalysisA PetriNetBased Technique for Synthesizing Large Concurrent Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 4, pp. 414426, April, 1993.  
BibTex  x  
@article{ 10.1109/71.219756, author = {Y. Chen and W.T. Tsai and D. Chao}, title = {Dependency AnalysisA PetriNetBased Technique for Synthesizing Large Concurrent Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {4}, issn = {10459219}, year = {1993}, pages = {414426}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.219756}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Dependency AnalysisA PetriNetBased Technique for Synthesizing Large Concurrent Systems IS  4 SN  10459219 SP414 EP426 EPD  414426 A1  Y. Chen, A1  W.T. Tsai, A1  D. Chao, PY  1993 KW  Index TermsPetri nets; concurrent systems; computational complexity; reachability; liveness;boundedness; dependency relations; computational complexity; parallel processing; Petrinets VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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.
[1] M. D'Anna and S. Trigila, "Concurrent system analysis using Petri nets: An optimized algorithm for finding net invariants,"Comput. Commun., vol. 11, no. 4, pp. 215220, Aug. 1988.
[2] G. Berthelot and R. Terrat, "Petri Nets theory for the correctness of protocols,"IEEE Trans. Commun., vol. COM30, no. 12, pp. 24972505, Dec. 1982.
[3] G. Berthelot, "Transformations and decompositions of nets," inAdvances in Petri Nets, LNCS, 1986, Part I, pp. 359376.
[4] A. Datta and S. Ghosh, "Synthesis of a class of deadlockfree Petri nets,"J. ACM, vol. 31, no. 3, pp. 486506, July 1984.
[5] A. Datta and S. Ghosh, "Modular Synthesis of DeadlockFree Control Structures," inFoundation of Software Technology and Theoretical Computer Science, LNCS 241, 1988, pp. 288318.
[6] U. Goltz, "Synchronic distance," inPetri Nets: Central Models and Their Properties, LNCS 254, 1986, pp. 338358.
[7] R. Lipton, "The reachability problem requires exponential space," Dep. CS, Yale Univ., Rep. 62, Jan. 1976.
[8] J. Martinez and M. Silva, "A simple and fast algorithm to obtain all invariants of a generalised Petri net,"Second European Workshop on Application and Theory of Petri Nets, 1982, pp. 301310.
[9] P. M. Merlin, "A methodology for the design and implementation of communication protocols,"IEEE Trans. Commun., vol. COM24, no. 6, pp. 614621, June 1976.
[10] T. Murata and J. Koh, "Reduction and expansion of live and safe marked graphs,"IEEE Trans. Circuits Syst., vol. CAS27, no. 1, pp. 6870, Jan. 1980.
[11] T. Murata, "Modeling and analysis of concurrent systems," inHandbook of Software Engineering, C. R. Vick and C. V. Ramamoorthy, Eds. New York: Van Nostrand Reihold, 1984, pp. 3963.
[12] T. Murata, "Petri nets: Properties, analysis, and applications,"Proc. IEEE, vol. 77, no. 4, pp. 541580, Apr. 1989.
[13] J. L. Peterson,Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: PrenticeHall, 1981.
[14] C. V. Ramamoorthy, S. T. Dong, and Y. Usuda, "An implementation of an automated protocol synthesizer (APS) and its application to the X.21 protocol,"IEEE Trans. Software Eng., vol. SE11, no. 9, pp. 886908, Sept. 1985.
[15] J. Sifakis, "Structural properties of Petri nets,"Math. Fund. Comp. Sci., Lecture Notes of Comput. Sci., Vol. 64. New York: SpringerVerlag, 1978, pp. 474483.
[16] I. Suzuki and T. Murata, "A method for hierarchically representing large scale Petri nets," inProc., IEEE Int. Conf. Circuits Comput., ICCC80, 1980, pp. 620623.
[17] I. Suzuki and T. Murata, "A method of stepwise refinement and abstraction of Petri nets,"J. Comput. Syst. Sci., vol. 27, pp. 5176, 1983.
[18] Valette, "Analysis of Petri nets by stepwise refinement,"J. Comput. Syst. Sci, vol. 18, pp. 3546, 1979.
[19] Y. Yaw, C. V. Ramamoorthy, and W. T. Tsai, "A synthesis approach for designing concurrent system," inProc. Second Parallel Processing Symp., Apr. 1988, pp. 143166.