Title :
Algorithms for Computing Weak Bisimulation Equivalence
Author_Institution :
Inst. of Software, Chinese Acad. of Sci., Beijing, China
Abstract :
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, Hopcroftpsilas idea of ldquoprocess the smaller halfrdquo 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.
Keywords :
computational complexity; formal verification; graph theory; formal verification; model checking; time complexity; transitional relation graph; unlabeled Kripke structure; weak bisimulation equivalence algorithm; Algorithm design and analysis; Automata; Computational modeling; Explosions; Formal verification; Hardware; Partitioning algorithms; Software algorithms; Software engineering; State-space methods;
Conference_Titel :
Theoretical Aspects of Software Engineering, 2009. TASE 2009. Third IEEE International Symposium on
Conference_Location :
Tianjin
Print_ISBN :
978-0-7695-3757-3
DOI :
10.1109/TASE.2009.47