algorithms for computing weak bisimulation equivalence
文献类型：会议论文
| 作者 | Li Weisong |
| 出版日期 | 2009 |
| 会议名称 | 3rd International Symposium on Theoretical Aspects of Software Engineering |
| 会议日期 | JUL 29-31, |
| 会议地点 | Tianjin, PEOPLES R CHINA |
| 关键词 | formal verification model checking time complexity transitional relation graph unlabeled Kripke structure weak bisimulation equivalence algorithm computational complexity formal verification graph theory |
| 英文摘要 | Weak bisimulation equivalence is an important relation in formal verification. There is only one specific algorithm for computing weak simulation equivalence on unlabeled Kripke structure. We exploit two ways to improve the algorithm for this problem. First, the transitional relation graph is reduced to its s.c.c component graph. Second, Hopcrofts idea of "process the smaller half" is incorporated to further improve time complexity. These two methods avoid the computation of transitive reflexive closure of the original transitional relation and achieve better time complexity in most practical cases of model checking. |
| 会议主办者 | IEEE Comp Soc, IFIP, Tianjin Normal Univ |
| 会议录 | Proceedings - 2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009
 |
| 会议录出版者 | THIRD INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS |
| 会议录出版地 | 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA |
| ISBN号 | 978-0-7695-3757-3 |
| 源URL | [http://124.16.136.157/handle/311060/8308]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Li Weisong. algorithms for computing weak bisimulation equivalence[C]. 见:3rd International Symposium on Theoretical Aspects of Software Engineering. Tianjin, PEOPLES R CHINA. JUL 29-31,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。