An Efficient Algorithm for Exploring State Spaces of Petri Nets with Large Capacities (Special Section on Concurrent Systems Technology)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2000-11-25

著者

• Hiraishi Kunihiko

  The School Of Information Science Japan Advanced Institute Of Science And Technology

関連論文

• An Efficient Algorithm for Exploring State Spaces of Petri Nets with Large Capacities (Special Section on Concurrent Systems Technology)
• An Algorithm for Legal Firing Sequence Problem of Petri Nets Based on Partial Order Method
• A Note on the Complexity of k-Ary Threshold Circuits
• Deriving Discrete Behavior of Hybrid Systems under Incomplete Knowledge

スポンサーリンク