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.
Similar content being viewed by others
References
Grid Computing: Towards a Global Interconnected Infrastructure, Preve, N.P., Ed., Springer, 2011.
Murata, T., Petri nets: properties, analysis and applications, Proc. of the IEEE, 1989, vol. 77, no. 4, pp. 541–580.
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.
Achasova, S.M. and Bandman, O.L., Correctness of Concurrent Computational Processes, N.: Nauka, 1990 [in Russian].
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.
Diaz, M., Modelling and analysis of communication and cooperation protocols using Petri net based model, Computer Networks, 1982, no. 6, pp. 419–441.
Li, Z.W. and Zhou, M.C., Deadlock Resolution in Automated Manufacturing Systems, Springer, 2010.
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.
Shmeleva, T.R., Verification of switched Ethernet protocols via infinite Petri nets, Proc. of DUIKT: Special Issue, Kyiv, 2007, pp. 96–102 [in Russian].
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.
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-y
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.
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.].
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).
Author information
Authors and Affiliations
Corresponding author
Additional information
The article is published in the original. Web-site: http://member.acm.org/~daze, http://daze.ho.ua
About this article
Cite this article
Zaitsev, D.A. Verification of computing grids with special edge conditions by infinite Petri nets. Aut. Control Comp. Sci. 47, 403–412 (2013). https://doi.org/10.3103/S0146411613070262
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411613070262