Abstract
We introduce bisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp. We compare our approach to the recently introduced antichain algorithms, by analysing and relating the two underlying coinductive proof methods. We give concrete examples where we exponentially improve over antichains; experimental results moreover show non negligible improvements.
Supplemental Material
- P. A. Abdulla, Y.-F. Chen, L. Holík, R. Mayr, and T. Vojnar. When simulation meets antichains. TACAS, vol. 6015 of phLNCS, pages 158--174. Springer, 2010. Google Scholar
Digital Library
- A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. Google Scholar
Digital Library
- A. Aiken and B. R. Murphy. Implementing regular tree expressions. FPCA, vol. 523 of phLNCS, pages 427--447. Springer, 1991. Google Scholar
Digital Library
- J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. PARLE (II), vol. 259 of phLNCS, pages 94--111. Springer, 1987. Google Scholar
Digital Library
- F. Bartels. phOn generalized coinduction and probabilistic specification formats. PhD thesis, Vrije Universiteit Amsterdam, 2004.Google Scholar
- F. Bonchi and D. Pous. Extended version of this abstract, with omitted proofs. http://hal.inria.fr/hal-00639716/, 2012\natexlaba.Google Scholar
- F. Bonchi and D. Pous. Web appendix for this paper. http://perso.ens-lyon.fr/damien.pous/hknt, 2012\natexlabb.Google Scholar
- A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract regular model checking. Proc. CAV, vol. 3114 of LNCS. Springer, 2004.Google Scholar
- R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers, 35 (8): 677--691, 1986. Google Scholar
Digital Library
- D. Caucal. Graphes canoniques de graphes algébriques. ITA, 24: 339--352, 1990.Google Scholar
- S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. phInformation and Computation, 121 (2): 143--148, 1995. Google Scholar
Digital Library
- L. Doyen and J.-F. Raskin. Antichain Algorithms for Finite Automata. TACAS, vol. 6015 of LNCS. Springer, 2010. Google Scholar
Digital Library
- J.-C. Fernandez, L. Mounier, C. Jard, and T. Jéron. On-the-fly verification of finite transition systems. Formal Methods in System Design, 1 (2/3): 251--273, 1992. Google Scholar
Digital Library
- M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. FOCS, pages 453--462. IEEE Computer Society, 1995. Google Scholar
Digital Library
- Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. phTheoretical Computer Science, 158 (1&2): 143--159, 1996. Google Scholar
Digital Library
- L. Holík and J.vSimávcek. Optimizing an LTS-Simulation Algorithm. phComputing and Informatics, 2010 (7): 1337--1348, 2010.Google Scholar
- J. E. Hopcroft. An n log n algorithm for minimizing in a finite automaton. International Symposium of Theory of Machines and Computations, pages 189--196. Academic Press, 1971.Google Scholar
Cross Ref
- J. E. Hopcroft and R. M. Karp. A linear algorithm for testing equivalence of finite automata. TR 114, Cornell Univ., December 1971.Google Scholar
- J. E. Hopcroft and J. D. Ullman. phIntroduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979. Google Scholar
Digital Library
- H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for XML. ACM Trans. Program. Lang. Syst., 27 (1): 46--90, 2005. Google Scholar
Digital Library
- et al.(2012)Lengál, Simácek, and Vojnar}LengalSV12O. Lengál, J. Simácek, and T. Vojnar. Vata: A library for efficient manipulation of non-deterministic tree automata. TACAS, vol. 7214 of LNCS, pages 79--94. Springer, 2012. Google Scholar
Digital Library
- M. Lenisa. From set-theoretic coinduction to coalgebraic coinduction: some results, some problems. ENTCS, 19: 2--22, 1999.Google Scholar
- D. Lucanu and G. Rosu. Circular coinduction with special contexts. ICFEM, vol. 5885 of LNCS, pages 639--659. Springer, 2009. Google Scholar
Digital Library
- A. Meyer and L. J. Stockmeyer. Word problems requiring exponential time. STOC, pages 1--9. ACM, 1973. Google Scholar
Digital Library
- R. Milner. Communication and Concurrency. Prentice Hall, 1989. Google Scholar
Digital Library
- D. Pous. Complete lattices and up-to techniques. APLAS, vol. 4807 of LNCS, pages 351--366. Springer, 2007. Google Scholar
Digital Library
- J. Rutten. Automata and coinduction (an exercise in coalgebra). CONCUR, vol. 1466 of LNCS, pages 194--218. Springer, 1998. Google Scholar
Digital Library
- D. Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8: 447--479, 1998. Google Scholar
Digital Library
- D. Sangiorgi. Introduction to Bisimulation and Coinduction. Cambridge University Press, 2011. Google Scholar
Digital Library
- D. Tabakov and M. Vardi. Experimental evaluation of classical automata constructions. LPAR, vol. 3835 of LNCS, pages 396--411. Springer, 2005. Google Scholar
Digital Library
- M. D. Wulf, L. Doyen, T. A. Henzinger, and J.-F. Raskin. Antichains: A new algorithm for checking universality of finite automata. CAV, vol. 4144 of LNCS, pages 17--30. Springer, 2006. Google Scholar
Digital Library
Index Terms
Checking NFA equivalence with bisimulations up to congruence
Recommendations
Checking NFA equivalence with bisimulations up to congruence
POPL '13: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesWe introduce bisimulation up to congruence as a technique for proving language equivalence of non-deterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp. We compare our ...
Bisimulation equivalence and regularity for real-time one-counter automata
A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where stack emptiness can be tested; it is a real-time automaton if it contains no ε-transitions. We study the computational complexity of the problems of equivalence and ...
Environmental bisimulations for higher-order languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with “up-to context” techniques, and (2) obtaining ...







Comments