Automatic Control and Computer Sciences

, Volume 47, Issue 7, pp 403–412 | Cite as

Verification of computing grids with special edge conditions by infinite Petri nets

Article

Abstract

A technique of the computing grids verification using invariants of infinite Petri nets was presented. Models of square grid structures in the form of parametric Petri nets for such edge conditions as connection of edges and truncated devices were constructed. Infinite systems of linear algebraic equations were composed on parametric Petri nets for calculating p-invariants; their parametric solutions were obtained. P-invariant Petri nets are structurally conservative and bounded that together with liveness are the properties of ideal systems. Liveness investigation based on siphons and traps can be implemented using p-invariants of modified nets.

Keywords

computing grid infinite Petri net invariant boundedness safeness liveness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Grid Computing: Towards a Global Interconnected Infrastructure, Preve, N.P., Ed., Springer, 2011.Google Scholar
  2. 2.
    Murata, T., Petri nets: properties, analysis and applications, Proc. of the IEEE, 1989, vol. 77, no. 4, pp. 541–580.CrossRefGoogle Scholar
  3. 3.
    Silva, M. and Colom, J.M., On the computation of structural synchronic invariants in P/T nets, Springer, LNCS, 1988, vol. 340, pp. 387–417.MathSciNetGoogle Scholar
  4. 4.
    Achasova, S.M. and Bandman, O.L., Correctness of Concurrent Computational Processes, N.: Nauka, 1990 [in Russian].Google Scholar
  5. 5.
    Berthelot, G. and Terrat, E., Petri nets theory for the correctness of protocols, IEEE Trans. on Communications, 1982, nol. 30, no. 12, pp. 2497–2505.CrossRefMathSciNetGoogle Scholar
  6. 6.
    Diaz, M., Modelling and analysis of communication and cooperation protocols using Petri net based model, Computer Networks, 1982, no. 6, pp. 419–441.Google Scholar
  7. 7.
    Li, Z.W. and Zhou, M.C., Deadlock Resolution in Automated Manufacturing Systems, Springer, 2010.Google Scholar
  8. 8.
    Zaitsev, D.A. and Zaitsev, I.D., Verification of Ethernet protocols via parametric composition of Petri net, INCOM’2006: 12th IFAC/IFIP/IFORS/IEEE/IMS Symposium Information Control Problems in Manufacturing, May 17–19 2006, Saint-Etienne, France, pp. 261–267.Google Scholar
  9. 9.
    Shmeleva, T.R., Verification of switched Ethernet protocols via infinite Petri nets, Proc. of DUIKT: Special Issue, Kyiv, 2007, pp. 96–102 [in Russian].Google Scholar
  10. 10.
    Shmeleva, T.R., Zaitsev, D.A., and Zaitsev, I.D., Analysis of square communication grids via infinite Petri nets, Transactions of Odessa National Academy of Telecommunication, 2009, no. 1, pp. 27–35.Google Scholar
  11. 11.
    Zaitsev, D.A. and Shmeleva, T.R., Verification of hypereube communication structures via parametric Petri nets, Cybernetics and Systems Analysis, 2010, vol. 46, no. 1, pp. 105–114, DOI: 10.1007/s10559-010-9189-yCrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Shmeleva. T.R., Proving consistency of Petri net grid models, Book of Abstracts of the International Scientific Conference on Computer Algebra and Information Technology, August 20–26, 2012, Odessa, Ukraine, pp. 83–86.Google Scholar
  13. 13.
    Zaitsev, D.A., Li, Z.W., Litvin, D.A., and Hou, Y.F., Calculating Petri net siphons via composition of clans, Proceedings of International Humanitarian University: Series ITPM, 2012, vol. 4, pp. 32–44 [in Ukr.].Google Scholar
  14. 14.
    Berthomieu, B., Eibet, O.-P., and Vernadat, F., The tool TINA-construction of abstract state space for Petri nets and time Petri nets, International Journal of Production Research, 2004, vol. 42, no. 14, pp. 2741–2756 (http://www.laas.fr/tina).CrossRefMATHGoogle Scholar

Copyright information

© Allerton Press, Inc. 2013

Authors and Affiliations

  1. 1.International Humanitarian UniversityOdessaUkraine

Personalised recommendations