| Presentation | 2009-01-29 An Algorithm for the Marking Construction Problem of Petri Nets Enhanced by a MAX-LFS Algorithm and Improvement of Post-processing Toshihisa ISHII, Satoshi TAOKA, Toshimasa WATANABE, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The marking construction problem (MCP) of Petri nets is defined as follows. "Given a Petri net N, an initial marking M_i and a target marking M_t find a marking that is closest to M_t among those which can be reached from M_i by firing transitions." MCP is known to be NP-hard, and two schemas of algorithm design are known depending on whether any algorithm for MAX-LFS is utilized or not. MCHF_k in the first schema and MCGT_k is the second one are known to have the highest capability in each schema. As for the first schema, an algorithm MC_feideq_gt_k is proposed as an improved version of MCHF_1. As for the second schema, we introduce a new measure access to be used in selecting on enable transition for rational firing, and an algorithm MCA is proposed by incorporating access value. Furthermore, an algorithm MC_feideq_a is proposed by replacing the post-processing MCGT_k of MC_feideq_gt_k with MCA. The three proposed algorithms are implemented and we compare their capability with existing algorithms through computing experiments. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Petri nets / marking construction problems / reachability problems / heuristic algorithms / computer experiments |
| Paper # | CST2008-44 |
| Date of Issue |
| Conference Information | |
| Committee | CST |
|---|---|
| Conference Date | 2009/1/22(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Concurrent System Technology (CST) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An Algorithm for the Marking Construction Problem of Petri Nets Enhanced by a MAX-LFS Algorithm and Improvement of Post-processing |
| Sub Title (in English) | |
| Keyword(1) | Petri nets |
| Keyword(2) | marking construction problems |
| Keyword(3) | reachability problems |
| Keyword(4) | heuristic algorithms |
| Keyword(5) | computer experiments |
| 1st Author's Name | Toshihisa ISHII |
| 1st Author's Affiliation | Graduate School of Engineering, Hiroshima University() |
| 2nd Author's Name | Satoshi TAOKA |
| 2nd Author's Affiliation | Graduate School of Engineering, Hiroshima University |
| 3rd Author's Name | Toshimasa WATANABE |
| 3rd Author's Affiliation | Graduate School of Engineering, Hiroshima University |
| Date | 2009-01-29 |
| Paper # | CST2008-44 |
| Volume (vol) | vol.108 |
| Number (no) | 415 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |