By Topic

The legal firing sequence problem of Petri nets with state machine structure

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

2 Author(s)
Morita, K. ; Graduate Sch. of Eng., Hiroshima Univ., Japan ; Watanabe, T.

The subject of this paper is the legal firing sequence problem (LFS) of Petri nets: given a Petri net PN, an initial marking M and a firing count vector X, find a firing sequence S which starts from M and each transition t appears in δ exactly X(t) times as prescribed by X. The results are as follows: (1) LFS is NP-complete even if PN has state machine structure with exactly two kinds of edge weights and X(t)=1 for every transition t; (2) linear time algorithms solving LFS are proposed for several classes of Petri nets having state machine structure

Published in:

Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on  (Volume:3 )

Date of Conference:

12-15 May 1996