An Efficient Method to Maintain the O-graph when Editing a Petri Net
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 97 === Petri Net can model many kinds of systems. An occurrence graph is the state diagram of a Petri net. It can show useful properties such as reachability, boundness, home, liveness, and fairness. This thesis presents a technique that reduces the occurrence graph...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/47789601861841665598 |