IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms
Satoshi TAOKAToshimasa WATANABE
Author information
JOURNALS RESTRICTED ACCESS

Volume E94.A (2011) Issue 9 Pages 1833-1841

Details
Download PDF (360K) Contact us
Abstract

The marking construction problem (MCP) of Petri nets is defined as follows: “Given a Petri net N, an initial marking Mi and a target marking Mt, construct a marking that is closest to Mt among those which can be reached from Mi by firing transitions.” MCP includes the well-known marking reachability problem of Petri nets. MCP is known to be NP-hard, and we propose two schemas of heuristic algorithms: (i) not using any algorithm for the maximum legal firing sequence problem (MAXLFS) or (ii) using an algorithm for MAXLFS. Moreover, this paper proposes four pseudo-polynomial time algorithms: MCG and MCA for (i), and MCHFk and MC_feideq_a for (ii), where MCA (MC_feideq_a, respectively) is an improved version of MCG (MCHFk). Their performance is evaluated through results of computing experiment.

Information related to the author
© 2011 The Institute of Electronics, Information and Communication Engineers
Previous article Next article

Recently visited articles
Journal news & Announcements
  • Please contact trans-a[a]ieice.org, if you want to unlock PDF security.
feedback
Top