By Topic

A method for structural analysis of Petri net models

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

5 Author(s)
Yigang Cai ; Div. of Electr. & Comput. Eng., Yokohama Nat. Univ., Japan ; T. Sekiguchi ; H. Tanaka ; M. Hikichi
more authors

Reachability tree and firing count vector provide information for solving the reachability problem in Petri nets. Firing count vector can be obtained as a solution of the equation of incidence matrix. In ordinary cases, an incidence matrix does not have full rank which is a necessary condition to obtain the inverse matrix for the solutions of the matrix equation. A method to make full rank matrix from an incidence matrix is to add some counter-places into the incidence matrix. However, in this method, the cycle structure and/or parallel structure of a given Petri net model must be identified and the total number of cycles and parallels must be known. Up to the present, there is no way to count cycle and parallel numbers in a given Petri net. In this paper, we prove that the number of cycles and/or parallels of a Petri net model must be n-r. Further, taking the advantage of the solutions of the homogeneous equation of transition invariants, we propose a method for identifying the cycle structure and/or parallel structure in that model

Published in:

Industrial Electronics, Control, and Instrumentation, 1993. Proceedings of the IECON '93., International Conference on

Date of Conference:

15-19 Nov 1993