Some approaches to attack the reachability problem of Petri nets
碩士 === 淡江大學 === 資訊工程學系 === 84 === At this high-developed computer technological age, each computer developerall try their best to offer people a faster and more convenient livingenvironment, so, the system grows bigger at size and becomes more complicated...
Main Authors: | Hsueh, Mei-huei, 薛美惠 |
---|---|
Other Authors: | Po-Zung Chen |
Format: | Others |
Language: | zh-TW |
Published: |
1996
|
Online Access: | http://ndltd.ncl.edu.tw/handle/70892126685576971955 |
Similar Items
-
An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees
by: Dan You, et al.
Published: (2018-01-01) -
Reachability Analysis of Petri Nets with Limited Communication Capabilities
by: Chien-Liang Chen, et al.
Published: (2009) -
On state-space compression and state reachability retrieval of Petri nets
by: Huorong Ren, et al.
Published: (2019-02-01) -
A geometric approach to integer optimization and its application for reachability analysis in Petri nets.
Published: (2009) -
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
by: Lasse Jacobsen, et al.
Published: (2012-11-01)