Automatic Control and Computer Sciences

, Volume 51, Issue 7, pp 666–677 | Cite as

On the Spatial Boundedness of Cellular RDA-nets

  • V. A. Bashkin


Cellular resource driven automata nets (CRDA-nets) are a generalization of the concept of two-level resource nets (Petri nets) with an introduction of an infinite regular system grid. This formalism is a hybrid of Petri nets and asynchronous Cellular Automata and is designed for modeling multi-agent systems with dynamic spatial structure. Spatial boundedness is a property that guarantees the preservation of the finiteness of “geometric dimensions” of the active part of the system (for example, the living space) during its lifetime. Three variants of spatial boundedness for cellular RDA-nets are defined: localization, bounded diameter and bounded area. The properties of the corresponding algorithmic problems are investigated, their undecidability in the general case is proved. A non-trivial criterion for the localization of an one-dimensional CRDA-net is proposed, based on the new concept of the RDA propagation graph. An algorithm is described for constructing a propagation graph, using the method of saturation of generating paths. A method for estimating the diameter of an 1-dim CRDA with a bounded propagation graph is presented.


multiagent systems verification Petri nets cellular automata resource driven automata nets spatial boundedness 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R. and Dill, D., Automata for modeling real-time systems, Lect. Notes Comput. Sci., 1990, vol. 443, pp. 322–325.MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bashkin, V.A., Nets of active resources for distributed systems modeling, Joint Bull. NCC&IIS, Comput. Sci., 2008, vol. 28, pp. 43–54.MATHGoogle Scholar
  3. 3.
    Bashkin, V.A., Formalization of semantics of systems with unreliable agents by means of nets of active resources, Progr. Comput. Software, 2010, vol. 36, no. 4, pp. 187–196.MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bashkin, V.A. and Lomazova, I.A., Resource driven automata nets, Fundam. Inf., 2011, no. 3, pp. 223–236.MathSciNetMATHGoogle Scholar
  5. 5.
    Bashkin, V.A. and Lomazova, I.A., Cellular resource driven automata nets, Fundam. Inf., 2012, nos. 3–4, pp. 245–259.MATHGoogle Scholar
  6. 6.
    Bashkin, V.A., Lomazova, I.A., and Novikova, Yu.A., Timed resource driven automata nets for distributed realtime systems modelling, Lect. Notes Comput. Sci., 2013, vol. 7979, pp. 13–25.CrossRefGoogle Scholar
  7. 7.
    Bednarczyk, M.A., Bernardinello, L., Pawlowski, W., and Pomello, L., Modelling mobility with Petri Hypernets, Lect. Notes Comput. Sci., vol. 3423, pp. 28–44Google Scholar
  8. 8.
    Cook, M., Universality in elementary cellular automata, Complex Syst., 2004, vol. 15, no. 1, pp. 1–40.MathSciNetMATHGoogle Scholar
  9. 9.
    Finkel, A. and Schnoebelen, Ph., Well-structured transition systems everywhere! Theor. Comput. Sci., 2001, nos. 1–2, pp. 63–92.Google Scholar
  10. 10.
    Jensen, K., Colored Petri Nets: Basic Concepts, Analysis Methods and Practical Use, Springer, 1994.Google Scholar
  11. 11.
    Köhler-Bußmeier, M., Hornets: Nets within nets combined with net algebra, Lect. Notes Comput. Sci., 2009, vol. 5606, pp. 243–262.CrossRefMATHGoogle Scholar
  12. 12.
    Kuzmin, E.V. and Chalyy, D.Yu., Decidability of boundedness problems for Minsky counter machines, Autom. Control Comput. Sci., 2010, vol. 44, no. 7, pp. 387–397.CrossRefMATHGoogle Scholar
  13. 13.
    Lomazova, I.A., Nested Petri Nets—a formalism for specification and verification of multi-agent distributed systems, Fundam. Inf., 2000, nos. 1–4, pp. 195–214.MathSciNetMATHGoogle Scholar
  14. 14.
    Nehaniv, C.L., Asynchronous automata networks can emulate any synchronous automata network, Int. J. Algebra Comput., 2004, vol. 14, nos. 5–6, pp. 719–739.MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Petri, C.A., Kommunikation mit Automaten, PhD Thesis, Bonn Institute für Instrumentelle Mathematik, 1962.Google Scholar
  16. 16.
    Reisig, W., Petri Nets. An Introduction, EATCS Monographs on Theoretical Computer Science, Springer, 1985.Google Scholar
  17. 17.
    Valk, R., Petri nets as token objects: An introduction to elementary object nets, Lect. Notes Comput. Sci., 1998, vol. 1420, pp. 1–25.CrossRefGoogle Scholar
  18. 18.
    Zaitsev, D.A., Verification of computing grids with special edge conditions by infinite Petri nets, Autom. Control Comput. Sci., 2013, vol. 47, no. 7, pp. 403–412.CrossRefGoogle Scholar

Copyright information

© Allerton Press, Inc. 2017

Authors and Affiliations

  1. 1.Demidov Yaroslavl State UniversityYaroslavlRussia

Personalised recommendations