| Title: | property checking for 1-place-unbounded petri nets |
| Author: | Wang Yunhe
; Jiang Bo
; Jiao Li
|
| Source: | Proceedings - 2010 4th International Symposium on Theoretical Aspects of Software Engineering, TASE 2010
|
| Conference Name: | 2010 4th International Symposium on Theoretical Aspects of Software Engineering, TASE 2010
|
| Conference Date: | August 25,
|
| Issued Date: | 2010
|
| Conference Place: | Taipei, Taiwan
|
| Keyword: | Graph theory
; Petri nets
; Software engineering
|
| Publish Place: | United States
|
| Indexed Type: | EI
|
| ISBN: | 9780770000000
|
| Department: | (1) State Key Laboratory of Computer Science, Institute of Software, Graduate University of Chinese Academy of Sciences, Beijing, China
|
| Sponsorship: | National Taiwan University; Res. Cent. Inf. Technol. Innov., Acad. Sin.; National Science Council; Ministry of Education; IEEE Computer Society
|
| English Abstract: | The reachability tree for an unbounded net system is infinite. By using ω symbol to represent infinitely many markings, coverability tree can provide a finite form. However, with too much information lost, it can not check properties such as reachability, deadlock freedom, liveness, etc. In this paper, an improved reachability tree (IRT for short) is constructed to enrich the ω representation for 1-place-unbounded nets. Based on the tree containing exactly all the reachable markings, an algorithm is proposed to check liveness of the system. © 2010 IEEE. |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/8862
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| 05587721.pdf（432KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Wang Yunhe,Jiang Bo,Jiao Li. property checking for 1-place-unbounded petri nets[C]. 见:2010 4th International Symposium on Theoretical Aspects of Software Engineering, TASE 2010. Taipei, Taiwan. August 25,.
|
|
|
