Affiliations: Yaroslavl State University, Yaroslavl, 150000, Russia, [email protected] | National Research University Higher School of Economics, Moscow, 101000, Russia | Program Systems Institute of the Russian Academy of Science, Pereslavl-Zalessky, 152020, Russia, [email protected]
Note: [] The research is partially supported by the Russian Fund for Basic Research (projects 11-01-00737, 11-07-00549).
Note: [] Address for correspondence: National Research University Higher School of Economics, Moscow, 101000, Russia This study was carried out within the National Research University Higher School of Economics' Academic Fund Program in 2012-2013, research grant No. 11-01-0032.
Abstract: Resource-driven automata (RDA) are finite automata, sitting in the nodes of a finite system net and asynchronously consuming/producing shared resources through input/output system ports (arcs of the system net). RDAs themselves may be resources for each other, thus allowing the highly flexible structure of the model. It was proved earlier, that RDA-nets are expressively equivalent to Petri nets [2]. In this paper the new formalism of cellular RDAs is introduced. Cellular RDAs are RDA-nets with an infinite regularly structured system net. We build a hierarchy of cellular RDA classes on the basis of restrictions on the underlying grid. The expressive power of several major classes of 1-dimensional grids is studied.
Keywords: multi-agent systems, mobile agents, Petri nets, cellular nets, Resource-Driven Automata
