Institutional Repository
| 基于状态空间的无界Petri网分析技术 | |
| Alternative Title | On the Analysis Techniques of Unbounded Petri Nets Based on the State Space |
| 江波 | |
| 2008-05-28 | |
| Degree Grantor | 中国科学院软件研究所 |
| Degree Level | 博士 |
| Place of Degree Grantor | 软件研究所 |
| Keyword | 标识 有界性 活性 无死锁性 分支进程 展开 前缀 |
| English Abstract | Petri 网提供了一种以图形和数学为基础的形式化建模方法。现在它已经成为建模和分析工业系统的成熟工具，其应用领域也越来越广泛，涉及到工作流管理，软件工程，并发程序设计，异步电路，协议验证等等。 目前对Petri 网的理论研究更多的是限于有界的情形，并且已经取得了相当大的成功，而无界Petri 网方面的研究进度则相对缓慢。在验证无界Petri 网系统的性质时往往面临着严重的状态爆炸问题。无界Petri 网系统的状态爆炸问题主要体现在两个方面：其一是变迁序列的周期性执行，其二是并发行为的交错执行。 针对第一种情形的状态爆炸，一般采用构造可达图的有限形式，即可覆盖树，但是可覆盖树有很大的局限性，例如不能验证网系统的可达性和活性等等。本文采用一种改进的可达树技术，一方面改进的可达树是有限的（即可以缓解这类状态爆炸问题），另一方面，我们可以直接使用改进的可达树来验证网系统的可达性和活性。 针对第二种情形的状态爆炸，方法之一是采用基于偏序语义的ω-分支进程技术。ω-分支进程结合了分支进程和可覆盖树两种技术，在验证系统的性质方面，它和可覆盖树一样具有一定的局限性，例如不能用来验证可达性问题。为使ω-分支进程能够验证可达性问题，本文结合改进的可达树技术，对ω-分支进程的改进工作做了初步的探讨。 |
| Abstract | Petri nets give a formal modeling method based on the graphics and mathematics. Nowadays they have been mature tools of modeling and analysis of manufacturing systems and received more and more widespread applications such as work-flow management, software engineering, concurrent programming design, asynchronous circuits, protocol verification, etc. So far, the theoretical research of Petri nets, on the most occasions, has been limited to the bounded Petri nets and much achievement has been obtained, while little research on the unbounded Petri nets has been available. The reason is that, for unbounded Petri nets, it is more difficult to handle the state explosion involved in the construction of the state space. This state explosion of unbounded Petri nets comes from two aspects: one is the periodic occurring of firing sequences, and the other is concurrent occurring of transitions. For the first aspect, the finite form of the reachability graph, the coverability tree, is constructed since the reachability graph of an unbounded Petri net is always infinite. However, the coverability tree has no ability of checking properties such as reachability and liveness. In this paper, we propose an improved reachability tree technique. It has two advantages: one is the finiteness of the improved reachability tree, the other is its ability of checking reachability and liveness. For the second aspect, one of the most prevalent solutions is the ω-branching process based on the partial order semantics. ω-branching processes result from the combination of the concepts of coverability tree and branching process. When checking properties, such as the reachability problem, the ω-branching processes have the same limitation as the coverability trees. In order to enhance the ability of checking the reachability, we describe a primitive improvement of ω-branching processes using the improved reachability tree techniques. |
| Pages | 58 |
| Language | 中文 |
| Content Type | 学位论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/6974 |
| Collection | 中科院软件所_中科院软件所 |
| Recommended Citation GB/T 7714 | 江波. 基于状态空间的无界Petri网分析技术[D]. 软件研究所. 中国科学院软件研究所,2008. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 10001_20052801502903（1204KB） | 限制开放 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment