JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/4689

Title: An Algorithm for Legal Firing Sequence Problem of Petri Nets Based on Partial Order Method
Authors: HIRAISHI, Kunihiko
TANAKA, Hirohide
Keywords: Petri net
legal firing sequence problem
partial order methods
stubborn sets
state space explosion
Issue Date: 2001-11-01
Publisher: 電子情報通信学会
Magazine name: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Volume: E84-A
Number: 11
Start page: 2881
End page: 2884
Abstract: The legal firing sequence problem of Petri nets (LFS) is one of fundamental problems in the analysis of Petri nets, because it appears as a subproblem of various basic problems. Since LFS is shown to be NP-hard, various heuristics has been proposed to solve the problem of practical size in a reasonable time. In this paper, we propose a new algorithm for this problem. It is based on the partial order verification technique, and reduces redundant branches in the search tree. Moreover, the proposed algorithm can be combined with various types of heuristics.
Rights: Copyright (C)2001 IEICE. Kunihiko Hiraishi and Hirohide Tanaka, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E84-A(11), 2001, 2881-2884. http://www.ieice.org/jpn/trans_online/
URI: http://hdl.handle.net/10119/4689
Material Type: publisher
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
1384.pdf210KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology