By Topic

Finding legal firing sequences in submarking reachability problems of Petri nets by discrete-time Pontryagin's minimum principle

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
$31 $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

1 Author(s)
Matsumoto, T. ; Fac. of Eng., Fukui Univ., Japan

The relaxed problems for SMR⊃MR have been formulated by PMP with a free terminal time; SMR using Theorem Al and MR using Corollary Al; note that MR-FV has been solved by PMP-LP with a fixed terminal time. Secondly, we have proven that each problem for SMR⊃MR can have nonnegative integer solution by using PMP-LP of which time complexity is semi-polynomial time in live TCC and SCC nets. But, checking critical siphons at each time is needed in the upper classes. We have also assured the above execution by computer simulations. These approaches can give useful approximation algorithms for various important reachability problems in practical applications

Published in:

Circuits and Systems, 1997. ISCAS '97., Proceedings of 1997 IEEE International Symposium on  (Volume:2 )

Date of Conference:

9-12 Jun 1997