Cellular Resource-Driven Automata

Authors:
Vladimir A. Bashkin;Irina A. Lomazova
Affiliations:
Yaroslavl State University, Yaroslavl, 150000, Russia, bas@uniyar.ac.ru;National Research University Higher School of Economics, Moscow, 101000, Russia and Program Systems Institute of the Russian Academy of Science, Pereslavl-Zalessky, 152020, Russia, i_lomazova@mail ...
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Year:
2012

Citing 10
Cited 0

Decidability Questions for Bismilarity of Petri Nets and Some Related Problems

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Bisimulation Equivalence is Decidable for Basic Parallel Processes

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Petri Nets as Token Objects: An Introduction to Elementary Object Nets

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Computation: finite and infinite machines

Computation: finite and infinite machines
Hornets: Nets within Nets Combined with Net Algebra

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Nested Petri nets for adaptive process modeling

Pillars of computer science
Indirect interaction in environments for multi-agent systems

E4MAS'05 Proceedings of the 2nd international conference on Environments for Multi-Agent Systems
Resource Driven Automata Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Nested Petri Nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems

Fundamenta Informaticae
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.