algorithms for computing weak bisimulation equivalence
| Data(s) |
2009
|
|---|---|
| Resumo |
IEEE Comp Soc, IFIP, Tianjin Normal Univ |
| Identificador | |
| Publicador |
THIRD INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA |
| Fonte |
Li Weisong.algorithms for computing weak bisimulation equivalence.见：THIRD INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS.Proceedings - 2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009,10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA,2009,241-248 |
| Palavras-Chave | #formal verification #model checking #time complexity #transitional relation graph #unlabeled Kripke structure #weak bisimulation equivalence algorithm #computational complexity #formal verification #graph theory |
| Tipo |
会议论文 |
