Presentation | 1999/11/9 An Unfolding Method to Check the Coverability for Unbounded Petri Nets R. Sasagawa, T. Miyamoto, S. Kumagai, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Though Petri nets have powerful mathematical verfication ability, in many cases we have to construct the state space for verification. We can avoid the state space explosion problem on bounded Petri nets by using unfolding. But, there was no idea for unbounded Petri nets. Therefore, we proposed an algorithm to construct unfolding for unbounded Prtri Nets at the last paper. In this paper, we propose a method to check the reachability and the coverability for unbounded Petri nets. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Petri nets / unfolding / unboundedness / coverability graph / reachability / coverability |
Paper # | CST99-34 |
Date of Issue |
Conference Information | |
Committee | CST |
---|---|
Conference Date | 1999/11/9(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 Unfolding Method to Check the Coverability for Unbounded Petri Nets |
Sub Title (in English) | |
Keyword(1) | Petri nets |
Keyword(2) | unfolding |
Keyword(3) | unboundedness |
Keyword(4) | coverability graph |
Keyword(5) | reachability |
Keyword(6) | coverability |
1st Author's Name | R. Sasagawa |
1st Author's Affiliation | Department of Electrical Engineering, Osaka University() |
2nd Author's Name | T. Miyamoto |
2nd Author's Affiliation | Department of Electrical Engineering, Osaka University |
3rd Author's Name | S. Kumagai |
3rd Author's Affiliation | Department of Electrical Engineering, Osaka University |
Date | 1999/11/9 |
Paper # | CST99-34 |
Volume (vol) | vol.99 |
Number (no) | 418 |
Page | pp.pp.- |
#Pages | 8 |
Date of Issue |