An Algorithm for Petri Nets Reachability by Unfoldings
Summary :
This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.3 pp.500-503
- Publication Date
- 1999/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Toshiyuki MIYAMOTO, Shun-ichiro NAKANO, Sadatoshi KUMAGAI, "An Algorithm for Petri Nets Reachability by Unfoldings" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 3, pp. 500-503, March 1999, doi: .
Abstract: This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_3_500/_p
Copy
@ARTICLE{e82-a_3_500,
author={Toshiyuki MIYAMOTO, Shun-ichiro NAKANO, Sadatoshi KUMAGAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Algorithm for Petri Nets Reachability by Unfoldings},
year={1999},
volume={E82-A},
number={3},
pages={500-503},
abstract={This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - An Algorithm for Petri Nets Reachability by Unfoldings
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 500
EP - 503
AU - Toshiyuki MIYAMOTO
AU - Shun-ichiro NAKANO
AU - Sadatoshi KUMAGAI
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1999
AB - This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.
ER -
English
