Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Cellular Resource-Driven Automata

Bashkin V.A., Lomazova I.A.

Fundamenta Informaticae

2012

Vol. 120, nr 3/4

243-257

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.

Resource Driven Automata Nets

Bashkin V.A., Lomazova I.A.

Fundamenta Informaticae

2011

Vol. 109, nr 3

223-236

A new formalism of Resource Driven Automata Nets (RDA-nets) is presented. A RDAnet has two levels: a system level is represented by a net of active resources, describing distribution of agents/resources and their interactions; agents in an object level are finite automata, communicating via ports and shared resources of a system level. RDA-nets are assigned for modeling mobility in multi-agent systems from the resource dependence perspective. We prove that RDA-nets have the same expressive power as Petri nets and give examples of modeling agent communications, dynamics and mobility.

Petri nets and resource bisimulation

Bashkin V.A., Lomazova I.A.

Fundamenta Informaticae

2003

Vol. 55, nr 2

101-114

Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn't change the Petri net's behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Petri nets, high-level Petri nets and nested Petri nets - Petri nets with Petri nets as tokens.