Skip to main content
SpringerLink
Log in

A synthesis technique of general petri nets

  • Published:
Journal of Systems Integration

Abstract

The general Petri net (GPN) is useful for modeling flexible manufacturing systems with multiple robots and workstations [15] and for parallel programs [8]. A problem of using reachability analysis for analyzing Petri nets (PN) is the large number of states generated. Most of the existing synthesis techniques do not deal with GPN. Koh et al.[15] invented a synthesis technique for GPN. We propose to improve their achievement by adding the simple Arc-ratio rules to Yaw's knitting technique [37, 38, 39] based on the notion of structure relationship together with new path generations, which mark the most distinct feature compared with other approaches. The synthesis rules and procedures of how to update the temporal matrix and structure synchronic distance are presented. The Arc-ratio rules for GPN are also presented. One can successfully synthesize complicated Petri nets using these rules. An example to synthesize a Petri net in [15] is illustrated. The correctness of each synthesis rule with an appropriate Arc-ratio rule for GPN is proved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Agerwala, and Y. Choed-Amphai, “A synthesis rule for concurrent systems”,Proc. of Design Automation Conference, pp. 305–311, 1978.

  2. G. Berthelot, “Checking properties of nets using transformations”, in G. Rozenberg (ed.),Advances in Petri Nets 1985, Springer-Verlag, pp. 19–40.

  3. G. W. Brams, “Reseaus de Petri”,Theoretical Computer Science, Springer-Verlag, 1985.

  4. W. Brauer, R. Gold, and W. Volger, “A survey of behavior and equivalence preserving refinements of Petri nets”, LNCS,Advances in Petri Nets 1990, Springer-Verlag, pp. 1–46.

  5. D.Y. Chao, T.H. Chen, D.T. Wang, and M.C. Zhou, “X window implementation of Petri net based animation for FMS”,Proc. 1992 IEEE Int'l Conf. SMC, Chicago, IL, Oct. 18–21, 1992, pp. 1651–1656.

  6. D.Y. Chao, M-C Zhou, and D.T. Wang, “Extending the knitting technique to Petri net synthesis of automated manufacturing system”,The Computer Journal, Oxford University Press to appear.

  7. D.Y. Chao, and D.T. Wang, “A reduction algorithm of petri net”,Proc. Int'l Comp Symp, Taichung, Taiwan, Dec. 1992, pp. 16–23.

  8. D.Y. Chao, M.C. Zhou, and D.T. Wang, “Multiple-weighted marked graphs”, to appear inPreprints of 12th World IFAC Congress 1993, Sydney, Australia, July 18–23, 1993, pp. 259–263.

  9. Y. Chen, W. T. Tsai, and D. Y. Chao, “Dependency analysis-A compositional technique for building large Petri net”,IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 4, pp. 414–426, 1993.

    Google Scholar 

  10. A. Datta, and S. Ghosh, “Synthesis of a class of deadlock-free Petri nets”,Journal of ACM, vol. 31, no. 3, pp. 486–506, 1984.

    Google Scholar 

  11. A. Datta, and S. Ghosh, “Modular synthesis of deadlock-free control structures”, LNCS 241,Foundation of Software Technology and Theoretical Computer Science, pp. 288–318, 1986.

  12. J. Esparza, and M. Silva, “Circuits, handles, bridges, and nets”,LNCS, Advances in Petri Nets 1990, Springer-Verlag pp. 210–212.

  13. J. Esparza, and M. Silva, “On the analysis and synthesis of free choice systems”, LNCS,Advances in Petri Nets 1990, Springer-Verlag, pp. 243–286.

  14. M.D. Jeng, and F. Dicesäre, “A modular synthesis techniques for Petri nets”,1992 Japan-USA Symp. on Flexible Automation, pp. 1163–1170.

  15. I. Koh, and F. DiCesare, “Transformation methods for generalized Petri nets and their applications to flexible manufacturing systems”,The 2nd International Conference on Computer Integrated Manufacturing, Troy, NY, 1990, pp. 364–371.

  16. B.H. Krogh, and C.L., Beck, “Synthesis of place/transition nets for simulation and control of manufacturing systems”,Proc. 4th IFAC/IFORS Symp. Large Scale systems (Zurich), 1986.

  17. K.H. Lee, and J. Favrel, “Hierarchical reduction method for analysis and decomposition of Petri nets”,IEEE Trans. Systems, Man, and Cybernetics, SMC-15, 2, pp. 272–280.

  18. R. Lipton, “The reachability problem requires exponential space”, Dept. of CS, Yale University, Report No. 62, January, 1976.

  19. J. Martinez, H. Alla, and M. Silva, “Petri nets for the specifications of FMSs”, in Kusiak, A. (Ed.).Modeling and Design of Flexible Manufacturing Systems. Amsterdam: Elsevier, 1986, pp. 389–406.

    Google Scholar 

  20. T. Murata, “Circuit theoretic analysis and synthesis of marked graphs”,IEEE Trans. Circ. and Sys., CAS-27, 1977, pp. 400–405.

    Google Scholar 

  21. T. Murata, “Synthesis of decision-free concurrent systems for prescribed resources and performance”,IEEE Trans. Software Engineering SE-6, no. 6, pp. 525–530, 1980.

    Google Scholar 

  22. T. Murata and J. Y. Koh, “Reduction and expansion of live and safe marked graphs”,IEEE Trans. Circ. and Sys., CAS-27, pp. 68–70.

  23. T. Murata, and N. Komoda, and K. Matsumoto, “A Petri net based controller for flexible and maintainable sequence control and its applications in factory automation”,IEEE Trans. Ind. Electron., vol. IE-33, pp. 1–8, 1986.

    Google Scholar 

  24. T. Murata, “Petri nets: properties, analysis and applications”,IEEE proceedings, vol. 77, no. 4, April 1989, pp. 541–580.

    Google Scholar 

  25. Y. Narahari, and N. Viswanadham, “A Petri net approach to the modeling and analysis manufacturing system”,Annals of Operations Research, vol. 3, pp. 449–472, 1985.

    Google Scholar 

  26. J.L. Peterson,Petri Net Theory and the Modeling of Systems, Prentice-Hall: Englewood Cliffs, New Jersey, 1981.

    Google Scholar 

  27. C.V. Ramamoorthy, S. T. Dong, and Y. Usuda, “The implementation of an automated protocol synthesizer (APS) and its application to the X.21 protocol”IEEE Trans. on Software Engineering, vol. SE-11, no. 9, September 1985, pp. 886–908.

    Google Scholar 

  28. C.V. Ramamoorthy, Y. Yaw, and W.T. Tsai, “A Petri net reduction algorithm for protocol analysis”,Computer Communication Review (USA), vol. 16, no. 3, pp. 157–166, 1986.

    Google Scholar 

  29. C.V. Ramamoorthy, Y. Yaw, W.T. Tsai, R. Aggarwal, and J. Song, “Synthesis of two-party error-recoverable protocols”,Computer Communication Review(USA), vol. 16, no. 3, Aug. 1986, pp. 227–235.

    Google Scholar 

  30. C.V. Ramamoorthy, Y. Yaw, W.T. Tsai, R. Aggarwal, and J. Song, “Synthesis and performance evaluation of two-party error-recoverable protocols”COMPSAC Symp., Oct. 1986, pp. 214–220.

    Google Scholar 

  31. W. Reisig, “Petri nets, EATCS monographs on theoretical computer science”, vol 4, Springer-Verlag: New York, 1985.

    Google Scholar 

  32. M. Silva, Las redes de Petri en la Automatica y la Informatica, Editorial AC, Madrid, 1985.

    Google Scholar 

  33. Y. Souissi, and G. Memmi, “Composition of nets via a communication medium”, LNCS,Advances in Petri Nets 1990, Springer-Verlag, pp. 457–470.

  34. L. Suzuki, and T. Murata, “A Method of Stepwise Refinement and Abstraction of Petri Nets”,Journal of Computer and System Sciences 27, 1983, pp. 51–76.

    Google Scholar 

  35. R. Valette, “Analysis of Petri nets by stepwise refinement”,Journal of Computer & System Sciences 18, 1979, pp. 35–46.

    Google Scholar 

  36. K.S. Valvanis, “On the hierarchical analysis and simulation of flexible manufacturing systems with extended Petri nets”,IEEE Trans. on System, Man, and Cybernetics, SMC 20, 1, pp. 94–100.

  37. Y. Yaw, “Analysis and Synthesis of Distributed Systems and Protocols”, Ph.D. Dissertation, Dept. of EECS, U. C. Berkeley, 1987.

    Google Scholar 

  38. Y. Yaw, C.V. Ramamoorthy, and W.T. Tsai, “A synthesis technique for designing concurrent systems”,Proc. Second Parallel Processing Symposium, Fullerton, CA, pp. 143–166, 1988.

  39. Y. Yaw and F.L. Foun, “The algorithm of a synthesis technique for concurrent systems,”1989 IEEE Int. Workshop on Petri Nets and Performance models” Dec. 1989, pp. 266–276.

  40. M-C. Zhou, F. Dicesare, and G. Goldbogen, “Computer-aided design of discrete event dynamic systems”, in 1989Beijing Int. Conf. on CAD and Computer Graphics, August 1989, pp. 766–771.

  41. M-C. Zhou,A Theory for the Synthesis and Augmentation for Petri Nets in Automation. Doctoral Dissertation, Department of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, May 1990.

    Google Scholar 

  42. M-C Zhou, F. DiCesare, and A.A. Desrochers, “A hybrid methodology for Petri net synthesis of manufacturing systems”,IEEE Trans. on Robotics and Automation, 8(3), pp. 361–380, 1992.

    Google Scholar 

  43. M-C. Zhou, and F. DiCesare (1991). “Parallel and sequential mutual exclusions for Petri net modeling for manufacturing systems with shared resources”,IEEE Trans. on Robotics and Automation, 7(4), pp. 515–527.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Integrated Systems Research, Department of Computer and Information Science, New Jersey Institute of Technology, 07102, Newark, NJ

    Daniel Y. Chao

  2. Institute for Integrated Systems Research, Department of Computer and Information Science, New Jersey Institute of Technology, 07102, Newark, NJ

    David T. Wang

Authors
  1. Daniel Y. Chao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David T. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chao, D.Y., Wang, D.T. A synthesis technique of general petri nets. Journal of Systems Integration 4, 67–102 (1994). https://doi.org/10.1007/BF01975673

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01975673

Key Words

Search

Navigation