Abstract
Until recently, algorithms for deciding bisimulation equivalence between normed context-free processes have all been nondeterministic. The optimal such algorithm, due to Huynh and Tian, is in Σ P2 =NPNP: it guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. Hirshfeld, Jerrum and Moller have since demonstrated that this problem is actually decidable in polynomial time. However, this algorithm is far from being practical, giving a O(n 13) algorithm, where n is (roughly) the size of the grammar defining the processes, that is, the number of symbols in its description. In this paper we present a deterministic algorithm which runs in time O(n 4 v) where v is the norm of the processes being compared, which corresponds to the shortest distance to a terminating state of the process, or the shortest word generated by the corresponding grammar. Though this may be exponential, it still appears to be efficient in practice, when norms are typically of moderate size. Also, the algorithm tends to behave well even when the norm is exponentially large. Furthermore, we believe that the techniques may lead to more efficient polynomial algorithms; indeed we have not been able to find an example for which our optimised algorithm requires exponential time.
The first author is on Sabbatical leave from The School of Mathematics and Computer Science, Tel Aviv University.
The second author is supported by Esprit Basic Basic Research Action No.7166 “CON-CUR2” and is currently at the Swedish Institute of Computer Science.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE'87, J.W. de Bakker, A.J. Nijman and P.C. Treleaven (eds), Lecture Notes in Computer Science 259, pp93–114. Springer-Verlag, 1987.
D. Caucal. Graphes canoniques des graphes algébriques. Informatique Théorique et Applications (RAIRO) 24(4), pp339–352, 1990.
S. Christensen, H. Hüttel and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR'92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp138–147. Springer-Verlag, 1992.
R.J. van Glabbeek. The linear time-branching time spectrum. In Proceedings of CONCUR'90, J. Baeten and J.W. Klop (eds), Lecture Notes in Computer Science 458, pp278–297. Springer-Verlag, 1990.
J.F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters 42, pp167–171, 1991.
J.F. Groote and H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 1994.
Y. Hirshfeld, M. Jerrum and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Department of Computer Science Research Report ECS-LFCS-94-286. University of Edinburgh, 1994.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 1979.
H. Hüttel and C. Stirling. Actions speak louder than words: proving bisimilarity for context-free processes. In Proceedings of LICS'91, IEEE Computer Society Press, pp376–386, 1991.
D.T. Huynh and L. Tian. Deciding bisimilarity of normed context-free processes is in Σ P2 . Journal of Theoretical Computer Science 123, pp183–197, 1994.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner and F. Moller. Unique decomposition of processes. Journal of Theoretical Computer Science 107, pp357–363, 1993.
D.M.R. Park. Concurrency and Automata on Infinite Sequences. Lecture Notes in Computer Science 104, pp168-183. Springer Verlag, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Hirshfeld, Y., Moller, F. (1994). A fast algorithm for deciding bisimilarity of normed context-free processes. In: Jonsson, B., Parrow, J. (eds) CONCUR '94: Concurrency Theory. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014997
Download citation
DOI: https://doi.org/10.1007/BFb0014997
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive