Summary
International Symposium on Nonlinear Theory and its Applications
2017
Session Number:A3L-B
Session:
Number:A3L-B-3
A Modified Algorithm and its Program for Obtaining Particular Solutions and Expansion Coefficients in P/T Petri Nets
Masahiro Osogami,
pp.233-236
Publication Date:2017/12/4
Online ISSN:2188-5079
Summary:
P/T Petri nets are one kind of basic and useful models for discrete event and concurrent systems and firing count vector for transitions are very important concepts when consider about reachability problem which is the most important behavioral properties of Petri nets in determining its behavior. To consider about the reachability problem, from M0 to Md are the fundamental problems of Petri nets. To solve such problems, the method using matrix equations and reduction techniques has the advantage better than using the cover ability(reachability) tree or using matrix equations. In this paper, we propose a modified algorithm of the Fourier-Motzkin method which is well known as a solution of the state equation for the reachability problem, and developing the program to use its algorithm. The solutions which could not be found by a conventional algorithm can be obtained by using the modified one. And also not only particular solutions and elementary T-invariants are obtained, but also the expansion coefficients can be obtained by the same program just changed the input.