Affiliation:
1. Université de Lyon, France
Abstract
We introduce
bisimulation up to congruence
as a technique for proving language equivalence of nondeterministic finite automata. Exploiting this technique, we devise an optimization of the classic algorithm by Hopcroft and Karp. We compare our approach to the recently introduced antichain algorithms and we give concrete examples where we exponentially improve over antichains. Experimental results show significant improvements.
Publisher
Association for Computing Machinery (ACM)
Reference24 articles.
1. Abdulla P.A. Chen Y.F. Holík L. Mayr R. and
Vojnar T
.
When simulation meets antichains
. In TACAS J. Esparza and R. Majumdar eds. Volume
6015
of
Lecture Notes in Computer Science (2010)
.
Springer 158--174. 10.1007/978-3-642-1
2002
-2_14 Abdulla P.A. Chen Y.F. Holík L. Mayr R. and Vojnar T. When simulation meets antichains. In TACAS J. Esparza and R. Majumdar eds. Volume 6015 of Lecture Notes in Computer Science (2010). Springer 158--174. 10.1007/978-3-642-12002-2_14
2. Generalised coinduction
3. Bonchi F. and Pous D. Extended version of this abstract with omitted proofs and web appendix for this work. http://hal.inria.fr/hal-00639716/ and http://perso.ens-lyon.fr/damien.pous/hknt 2012. Bonchi F. and Pous D. Extended version of this abstract with omitted proofs and web appendix for this work. http://hal.inria.fr/hal-00639716/ and http://perso.ens-lyon.fr/damien.pous/hknt 2012.
4. Bouajjani A. Habermehl P. and
Vojnar T
.
Abstract regular model checking
. In CAV R. Alur and D. Peled eds. Volume
3114
of
Lecture Notes in Computer Science (2004)
.
Springer
. Bouajjani A. Habermehl P. and Vojnar T. Abstract regular model checking. In CAV R. Alur and D. Peled eds. Volume 3114 of Lecture Notes in Computer Science (2004). Springer.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献