Presentation | 1994/11/17 On the Minimum Initial Submarking Problem of Petri Nets Toshimasa Watanabe, Keisuke Morita, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | The paper introduces the minimum initial submarking problem of Petri nets. First, the general problem is shown to be NP-hard. Next, a subproblem whose solutions can be found by a pseudo-polynomial time algorithm is given. Finally, some approximation algorithms for the general problem are proposed, and experimental results are also provided in order to show their capability. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Petri net / Initial markings / Pseudo-polynomial time algorithms / Approximation algorithms |
Paper # | CAS94-66,CST94-26 |
Date of Issue |
Conference Information | |
Committee | CST |
---|---|
Conference Date | 1994/11/17(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 | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | On the Minimum Initial Submarking Problem of Petri Nets |
Sub Title (in English) | |
Keyword(1) | Petri net |
Keyword(2) | Initial markings |
Keyword(3) | Pseudo-polynomial time algorithms |
Keyword(4) | Approximation algorithms |
1st Author's Name | Toshimasa Watanabe |
1st Author's Affiliation | Department of Circuits and Systems, Faculty of Engineering, Hiroshima University() |
2nd Author's Name | Keisuke Morita |
2nd Author's Affiliation | Department of Circuits and Systems, Faculty of Engineering, Hiroshima University |
Date | 1994/11/17 |
Paper # | CAS94-66,CST94-26 |
Volume (vol) | vol.94 |
Number (no) | 333 |
Page | pp.pp.- |
#Pages | 8 |
Date of Issue |