By Topic

Hierarchical reduction method for analysis and decomposition of Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kwang-Hyung Lee ; Laboratoire Informatique Appliquée of Institut National des Sciences Appliquées de Lyon (INSA), 69621 Villeurbanne, France; 1585-6, Shinlim-1-dong, Kwanak-ku, Seoul, Korea ; Joël Favrel

A hierarchical reduction method for Petri nets is proposed. After a brief survey on the existing methods of Petri net reduction, concepts such as reducible subnet, degree of subnet, and macronode are defined. The subnets are partially ordered by the degree of subnet, and thus the reducible subnets can be reduced into the macronodes. A reduced net can be obtained without changing the properties (for example, liveness and boundedness). A sequence of reduction results in a hierarchy of reduced Petri nets that allow easy verification and hierarchical decomposition of the system.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-15 ,  Issue: 2 )