The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Menjana ruang keadaan adalah salah satu kaedah penting dan umum dalam analisis jaring Petri. Terdapat dua sebab mengapa ruang keadaan jaring Petri menjadi begitu besar. Satu ialah peralihan yang berlaku serentak, dan satu lagi adalah urutan penembakan yang berlaku secara berkala. Kertas kerja ini memberi tumpuan kepada masalah kedua, dan mencadangkan algoritma baharu untuk meneroka ruang keadaan kapasiti terhingga jaring Petri dengan kapasiti besar. Dalam algoritma yang dicadangkan, ruang keadaan diwakili dalam bentuk pokok supaya satu set tanda yang dijana oleh kejadian berkala urutan penembakan dikaitkan dengan setiap nod, dan ia jauh lebih kecil daripada graf kebolehcapaian.
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.
Salinan
Kunihiko HIRAISHI, "An Efficient Algorithm for Exploring State Spaces of Petri Nets with Large Capacities" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 11, pp. 2188-2195, November 2000, doi: .
Abstract: Generating state spaces is one of important and general methods in the analysis of Petri nets. There are two reasons why state spaces of Petri nets become so large. One is concurrent occurring of transitions, and the other is periodic occurring of firing sequences. This paper focuses on the second problem, and proposes a new algorithm for exploring state spaces of finite capacity Petri nets with large capacities. In the proposed algorithm, the state space is represented in the form of a tree such that a set of markings generated by periodic occurrences of firing sequences is associated with each node, and it is much smaller than the reachability graph.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_11_2188/_p
Salinan
@ARTICLE{e83-a_11_2188,
author={Kunihiko HIRAISHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Algorithm for Exploring State Spaces of Petri Nets with Large Capacities},
year={2000},
volume={E83-A},
number={11},
pages={2188-2195},
abstract={Generating state spaces is one of important and general methods in the analysis of Petri nets. There are two reasons why state spaces of Petri nets become so large. One is concurrent occurring of transitions, and the other is periodic occurring of firing sequences. This paper focuses on the second problem, and proposes a new algorithm for exploring state spaces of finite capacity Petri nets with large capacities. In the proposed algorithm, the state space is represented in the form of a tree such that a set of markings generated by periodic occurrences of firing sequences is associated with each node, and it is much smaller than the reachability graph.},
keywords={},
doi={},
ISSN={},
month={November},}
Salinan
TY - JOUR
TI - An Efficient Algorithm for Exploring State Spaces of Petri Nets with Large Capacities
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2188
EP - 2195
AU - Kunihiko HIRAISHI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2000
AB - Generating state spaces is one of important and general methods in the analysis of Petri nets. There are two reasons why state spaces of Petri nets become so large. One is concurrent occurring of transitions, and the other is periodic occurring of firing sequences. This paper focuses on the second problem, and proposes a new algorithm for exploring state spaces of finite capacity Petri nets with large capacities. In the proposed algorithm, the state space is represented in the form of a tree such that a set of markings generated by periodic occurrences of firing sequences is associated with each node, and it is much smaller than the reachability graph.
ER -