Vladimir A. Bashkin

  • Citations Per Year
Learn More
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(More)
A new method for modeling distributed systems—nets of active resources—is presented. The expressive power of this formalism is similar to that of ordinary Petri nets, but its syntax relies on a different modeling principle: instead of partitioning model components (nodes of the graph) into agents and resources (transitions and places), partitioning of the(More)
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. RDA-nets are expressively equivalent to(More)
In this work we consider modeling of workflow systems with Petri nets. A resource workflow net (RWF-net) is a workflow net, supplied with an additional set of initially marked resource places. Resources can be consumed and/or produced by transitions. We do not constrain neither the intermediate nor final resource markings, hence a net can have an infinite(More)
The paper presents a formalism and a tool for modelling and analysis of distributed real-time systems of mobile agents. For that we use a time extension of our Resource Driven Automata Nets (TRDA-nets) formalism. A TRDA-net is a two-level system. The upper level represents distributed environment locations with a net of active resources. On the lower level(More)
This article describes the organization principles for wireless mesh networks (softwaredefined networks of mobile objects). The emphasis is placed on developing effective routing algorithms for these networks. The mathematical model of the system is the standard transportation network. The key parameter of the routing system is the node reachability(More)