A new method for converting extended version of petri nets to fuzzy extended markup language

Abstract In this paper a new method of Petri net array-based synthesis is proposed. The method is based on decomposition of colored interpreted macro Petri net into state machine subnets. Each state machine subnet is determined by one color. During the decomposition process macroplaces are expanded or replaced by doublers of macroplace. Such decomposition leads to parallel implementation of a digital system. The structured encoding of places is done by using minimal numbers of bits. Colored microoperations, which are assigned to places, are written into distributed and flexible memories. It leads to realization of a logic circuit in a two-level concurrent structure, where the combinational circuit of the first level is responsible for firing transitions, and the second level memories are used for generation of microoperations. Such an approach allows balanced usage of different kinds of resources available in modern FPGAs

Download Full-text

Power Grid Fault Diagnosis Method Using Intuitionistic Fuzzy Petri Nets Based on Time Series Matching

Complexity ◽

10.1155/2019/7890652 ◽

2019 ◽

Vol 2019 ◽

pp. 1-14 ◽

Cited By ~ 3

Author(s):

Mingyue Tan ◽

Jiming Li ◽

Xiangqian Chen ◽

Xuezhen Cheng

Keyword(s):

Time Series ◽

Fault Diagnosis ◽

Petri Nets ◽

Power Grid ◽

New Method ◽

Uncertain Information ◽

Intuitionistic Fuzzy ◽

Fuzzy Petri Nets ◽

Diagnosis Method ◽

Diagnosis Model

To improve the reliability of power grid fault diagnosis by enhancing the processing ability of uncertain information and adequately utilizing the alarm information about power grids, a fault diagnosis method using intuitionistic fuzzy Petri Nets based on time series matching is proposed in this paper. First, the alarm hypothesis sequence and the real alarm sequence are constructed using the alarm information and the general grid protection configuration model, and the similarity of the two sequences is used to calculate the timing confidence. Then, an intuitionistic fuzzy Petri Nets fault diagnosis model, with an excellent ability to process uncertain information from intuitionistic fuzzy sets, is constructed, and the initial place value of the model is corrected by the timing confidence. Finally, an application of the fault diagnosis model for the actual grid is established to analyze and verify the diagnostic results of the new method. The results for some test cases show that the new method can improve the accuracy and fault tolerance of fault diagnosis, and, furthermore, the abnormal state of the component can be inferred.

Download Full-text

Разработка нечеткой модели управления насосным агрегатом с применением раскрашенной сети Петри

Вестник ВГУ. Серия: Системный анализ и информационные технологии ◽

10.17308/sait.2020.3/3042 ◽

2020 ◽

pp. 77-86

Author(s):

Шахла Сурхай Гусейнзаде

Keyword(s):

Petri Nets ◽

Colored Petri Nets ◽

Markup Language ◽

Cpn Tools

Статья посвящена моделированию нечеткого управления на сетях Петри (СП). Ставится задача разработки модели управления на СП с нечеткой логикой по информации, выраженной в лингвистической форме. На основе критериев работы водяного насоса в зависимости от изменяющего водопотребления определены всевозможные ситуации и события в системе. Для описания не полных знаний по поведению системы использованы лингвистические переменные «расход воды» и «скорость насоса». Термы этих переменных соответствуют их нечетким значениям и обозначаются выражениями, характеризующими одно из состояний системы. Фаззификация лингвистических переменных выполнена в среде Fuzzy Toolbox системы моделирования MATLAB. Описывая необходимое поведение системы отношениями между ситуациями и событиями с применением логики «Если... То...» разработана система правил управления насосного агрегата. Всевозможными ситуациями, событиями и отношениями между ними соответственно формированы множества позиций, переходов и дуг СП. Учитывая систему продукционных правил управления и структурных элементов СП, разработан алгоритм управления насосного агрегата. На основе разработанного алгоритма управления определены функции входных и выходных инциденций переходов в виде таблиц. Таблицы определяют матриц входных и выходных инциденций переходов. Разработана граф-модель СП. Модель описывает работу одного насосного агрегата. Визуализация модели реализована в системе CPN Tools (Colored Petri Nets Tools). Значения термов принимаются как атрибуты цветов раскрашенной сети Петри (РСП) и с применением CPN ML (Colored Petri Nets Markup Language) присваивается маркерам сети. С помощью значений термов описывается поведение и желаемая реакция системы. Проведены симуляционные эксперименты соответственно ситуациям в системе и анализ модели на основе свойств СП.

Download Full-text

Dimension of the generalized 4-corner set and its projections

Ergodic Theory and Dynamical Systems ◽

10.1017/s014338571100023x ◽

2011 ◽

Vol 32 (4) ◽

pp. 1190-1215 ◽

Cited By ~ 3

Author(s):

BALÁZS BÁRÁNY

Keyword(s):

Hausdorff Dimension ◽

Fixed Points ◽

Iterated Function Systems ◽

Common Fixed Points ◽

New Method ◽

Dimension Theory ◽

Box Dimension ◽

Extended Version ◽

Iterated Function ◽

Self Similar

AbstractIn the last two decades, considerable attention has been paid to the dimension theory of self-affine sets. In the case of generalized 4-corner sets (see Figure 1), the iterated function systems obtained as the projections of self-affine systems have maps of common fixed points. In this paper, we extend our result [B. Bárány. On the Hausdorff dimension of a family of self-similar sets with complicated overlaps. Fund. Math. 206 (2009), 49–59], which introduced a new method of computation of the box and Hausdorff dimensions of self-similar families where some of the maps have common fixed points. The extended version of our method presented in this paper makes it possible to determine the box dimension of the generalized 4-corner set for Lebesgue-typical contracting parameters.

Download Full-text

A new method for finding firing sequences for the reachability problem of Petri nets by using a linear programming technique

Proceedings of 1994 IEEE International Symposium on Industrial Electronics (ISIE'94) ◽

10.1109/isie.1994.333111 ◽

2002 ◽

Cited By ~ 2

Author(s):

Y. Fujii ◽

T. Sekiguchi

Keyword(s):

Linear Programming ◽

Petri Nets ◽

New Method ◽

Reachability Problem ◽

Programming Technique ◽

Linear Programming Technique

Download Full-text

XML format for notation of object-oriented Petri net

Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis ◽

10.11118/actaun200755030047 ◽

2007 ◽

Vol 55 (3) ◽

pp. 47-56 ◽

Cited By ~ 1

Author(s):

Petr Jedlička

Keyword(s):

Petri Nets ◽

Petri Net ◽

Object Oriented ◽

Markup Language ◽

Verification Of Models ◽

Petri Net Markup Language ◽

Interchange Format ◽

High Level ◽

Object Petri Net ◽

Object Oriented Systems

Petri nets provide executive facilities for simulation of causality, non-determinism and parallelism in discreet systems. Since they are a mathematical model in substance, they offer theory, which can be successfully used to verification of models. Executability of Petri nets predestinates them for simulation and fast prototyping. Object Petri nets represent rather complicated class, based on hierarchical and high-level Petri nets. However their complexity is balanced by their ability to identify significant characteristics of system model and to visualize it in a graphic representation.Tools currently applied to modeling, simulation and verification of various Petri net variants use language PNML (Petri Net Markup Language) as an interchange format. However PNML is not capable of expression of object Petri net. This paper introduces prototype of XML-based language for modeling of parallel object-oriented systems described by object Petri net. This language, based on PNML, was named OPNML (Object Petri Net Markup Language).

Download Full-text

Construction of Occurrence Graphs with Permutation Symmetries Aided by the Backtrack Method

DAIMI Report Series ◽

10.7146/dpb.v26i516.7045 ◽

2002 ◽

Vol 26 (516) ◽

Author(s):

Jens Bæk Jørgensen

Keyword(s):

Group Theory ◽

Petri Nets ◽

Performance Measures ◽

New Method ◽

Coloured Petri Nets ◽

State Spaces ◽

Experimental Performance ◽

Speed Up ◽

Backtrack Algorithm ◽

Reduced State

This paper recalls the concept of occurrence graphs with permuta- tion symmetries (OS-graphs) for Coloured Petri Nets. It is explained how so-called self-symmetries can help to speed up construction of OS- graphs. The contribution of the paper is to suggest a new method for calculation of self-symmetries, the Backtrack Method. The method is based on the so-called Backtrack Algorithm, which originates in com- putational group theory. The suggestion of the method is justified, both by identifying an important general complexity property and by obtaining encouraging experimental performance measures.Topics. Coloured Petri Nets, reduced state spaces, occurrence graphs with permutation symmetries, self-symmetries, computational group theory, backtrack searches.

Download Full-text