canonical transition set semantics for petri nets
文献类型：会议论文
| 作者 | Wang Yunhe ; Jiao Li |
| 出版日期 | 2010 |
| 会议名称 | 31st International Conference on Appliations and Theory of Petri Nets and Other Models of Concurrency |
| 会议日期 | JUN 21-25, |
| 会议地点 | Braga, PORTUGAL |
| 关键词 | Petri nets partial order reduction canonical transition set semantics state space exploration step semantics |
| 页码 | 84-103 |
| 英文摘要 | A new partial order semantics called canonical transition set (CTS for short) semantics is proposed for P/T nets. We first prove that it is well-defined, sound and complete, and then give a state space exploring method based on it. CTS semantics provides a compressed representation for the interleaving transition sequences of finite length. Compared with other methods, the state space exploration based on CTS semantics can avoid many redundant branches and reach all states in less steps. Furthermore, we show that CTS semantics coincides with step semantics in Foata normal form 8 for pure 1-safe nets, which gives an experimental support that CTS semantics is more efficient for state space exploration. As for a special property, deadlock, we show that all deadlocks can be detected by a method combining CTS semantics with persistent set method. |
| 会议主办者 | Inst Polytecn Beja |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版者 | APPLICATIONS AND THEORY OF PETRI NETS, PROCEEDINGS |
| 会议录出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| ISSN号 | 0302-9743 |
| ISBN号 | 978-3-642-13674-0 |
| 源URL | [http://124.16.136.157/handle/311060/8684]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Wang Yunhe,Jiao Li. canonical transition set semantics for petri nets[C]. 见:31st International Conference on Appliations and Theory of Petri Nets and Other Models of Concurrency. Braga, PORTUGAL. JUN 21-25,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。