MODELING THE DYNAMIC INTERACTION PROCESSES USING OF FUZZY TIMED PETRI NETS OF TYPE VF

2019 ◽  
pp. 19-26
Author(s):  
V. A. Mustafayev ◽  
M. N. Salmanova
Keyword(s):  
Petri Nets ◽  
Matrix Theory ◽  
Production Model ◽  
Timed Petri Nets ◽  
Complex Objects ◽  
Structure Representation ◽  
Effective Form ◽  
The Matrix ◽  
Composition Laws ◽  
Analysis Models

The dynamic interacting processes modeling is examined in the article, which shows the complex objects operation in the condition of uncertainty. A formalism intended for the development and analysis models of complex parallel and distributed systems is proposed. It is based on the mathematical apparatus of the fuzzy timed Petri nets (FTPN) of type Vf, representing generalized FTPN of type Vf , combining deterministic and non-deterministic character. The algorithm for the functioning FTPN of type Vf is developed. The proposed algorithm provides a solution to the problem of the triggering solvability of transitions occurring in conflict states, the imposition of a fuzzy structure on the network marking with fuzzy composition laws that determine the values the degrees of belonging the input and output transition positions. The model of parallel functioning processing devices is presented in the FTPN form of type Vf. An approach is proposed for modeling dynamic interacting processes based on the matrix theory of Petri nets, that provides an effective form of structure representation, model state dynamics, the space of achievable states, and triggering transitions sequence in the form of vectors and matrices set. On the example of the production model of mechanical processing, it is shown that the accepted triggering transitions rules fully show the functioning FTPN process of type Vf. As a result of the simulation, the reachability tree is obtained as a sequence of matrices.

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets

2013 ◽  
Vol E96.A (2) ◽  
pp. 540-553
Author(s):  
Satoru OCHIIWA ◽  
Satoshi TAOKA ◽  
Masahiro YAMAUCHI ◽  
Toshimasa WATANABE
Keyword(s):  
Petri Nets ◽  
Heuristic Algorithms ◽  
Timed Petri Nets

scholarly journals Partial Component Consensus of Discrete-Time Multiagent Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-5
Author(s):  
Wenjun Hu ◽  
Gang Zhang ◽  
Zhongjun Ma ◽  
Binbin Wu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Matrix Theory ◽  
Pinning Control ◽  
Directed Network ◽  
Strong Function ◽  
Partial Stability ◽  
Partial Component ◽  
The Matrix ◽  
Error System

The multiagent system has the advantages of simple structure, strong function, and cost saving, which has received wide attention from different fields. Consensus is the most basic problem in multiagent systems. In this paper, firstly, the problem of partial component consensus in the first-order linear discrete-time multiagent systems with the directed network topology is discussed. Via designing an appropriate pinning control protocol, the corresponding error system is analyzed by using the matrix theory and the partial stability theory. Secondly, a sufficient condition is given to realize partial component consensus in multiagent systems. Finally, the numerical simulations are given to illustrate the theoretical results.

A Compositional Semantics for Timed Petri Nets1

1990 ◽  
Vol 13 (2) ◽  
pp. 141-170
Author(s):  
Andrea Maggiolo-Schettini ◽  
Józef Winkowski
Keyword(s):  
Petri Nets ◽  
Compositional Semantics ◽  
Timed Petri Nets ◽  
Event Structures ◽  
Configuration Systems

Timed Petri nets and their behaviours are considered. A concept of a seminet is introduced. which generalizes the concept of a net, and suitable operations on seminets are defined, which allow constructing seminets from atoms corresponding to places and transitions. The behaviours of seminets are given in the form of so called configuration systems, a notion close to labelled event structures. Such behaviours can be combined with the aid of operations corresponding to those on seminets. In particular, the behaviour of a compound seminet can be obtained by combining the behaviours of components.

scholarly journals MATRIX THEORY, HILBERT SCHEME AND INTEGRABLE SYSTEM

1998 ◽  
Vol 13 (34) ◽  
pp. 2731-2742 ◽  
Author(s):  
YUTAKA MATSUO
Keyword(s):  
Hilbert Scheme ◽  
Matrix Theory ◽  
Fock Space ◽  
Homology Class ◽  
Orthogonal Basis ◽  
Inner Product ◽  
Virasoro Symmetry ◽  
Hilbert Scheme Of Points ◽  
The Matrix ◽  
Boson Fock Space

We give a reinterpretation of the matrix theory discussed by Moore, Nekrasov and Shatashivili (MNS) in terms of the second quantized operators which describes the homology class of the Hilbert scheme of points on surfaces. It naturally relates the contribution from each pole to the inner product of orthogonal basis of free boson Fock space. These bases can be related to the eigenfunctions of Calogero–Sutherland (CS) equation and the deformation parameter of MNS is identified with coupling of CS system. We discuss the structure of Virasoro symmetry in this model.

Sign in / Sign up

Export Citation Format

Share Document