2015Unpublished venueRequires access

Study and Realization on the Partitioning Algorithm of Parallel Subnet of Petri Net System

Wenjing Li, Xiangbo Zhang, Yingzhou Bi, Xuan Wang

Open publisher page 0 citations

Abstract

In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariant based Petri net model partitioning and subnet division conditions and parallelizing analysis, put forward the extended theorem and validation of partitioning condition of parallel subnet, then, provide the formalization of subnet division and the solving process of place invariant and place-invariant based partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.

About this research paper

What this paper is about

In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariant based Petri net model partitioning and subnet division conditions and parallelizing analysis, put forward the extended theorem and validation of partitioning condition of parallel subnet, then, provide the formalization of subnet division and the solving process of place invariant and place-invariant based partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to solve the problem about the partition of Petri net model and subnet division, realize the concurrent execution or simulation runs of Petri net system, the partitioning algorithm of parallel subnet of Petri net is proposed. First, as Petri net system has the characteristics of synchronization and concurrence, provide the place-invariant based Petri net model partitioning and subnet division conditions and parallelizing analysis, put forward the extended theorem and validation of partitioning condition of parallel subnet, then, provide the formalization of subnet division and the solving process of place invariant and place-invariant based partitioning algorithm of parallel subnet of Petri net. The experimental results show that the partitioning algorithm of parallel subnet of place-invariant-based Petri net is feasible and effective.

Key concepts: Subnet, Petri net, Computer science, Stochastic Petri net, Partition (number theory), Invariant (physics), Realization (probability), Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Study and Realization on the Partitioning Algorithm of Parallel Subnet of Petri Net System — Research Paper | ScholarLens