Indiana University-Purdue University Indianapolis (IUPUI) / This thesis proposed an algorithm that can find optimized Petri nets from given observation sequences according to some rules of optimization. The basic idea of this algorithm is that although the length of the observation sequences can keep growing, we can think of the growing as periodic and algorithm deals with fixed observations at different time. And the algorithm developed has polynomial complexity. A segment of example code programed according to this algorithm has also been shown.
Furthermore, we modify this algorithm and it can check whether a Petri net could fit the observation sequences after several steps. The modified algorithm could work in constant time. These algorithms could be used in optimization of the control systems and communication networks to simplify their structures.
| Identifer | oai:union.ndltd.org:IUPUI/oai:scholarworks.iupui.edu:1805/7954 |
| Date | 08 June 2015 |
| Creators | Ruan, Keyu |
| Contributors | Li, Lingxi, King, Brian, Chien, Stanley Yung-Ping |
| Source Sets | Indiana University-Purdue University Indianapolis |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Rights | Attribution-NonCommercial 3.0 United States, http://creativecommons.org/licenses/by-nc/3.0/us/ |
Page generated in 0.0018 seconds