Abstract
We study the complexity of deciding bisimilarity between non-deterministic processes. In particular, we consider a calculus with recursive definitions of processes, value passing (i.e. input/output of data) and an equality test over data. We show that the bisimilarity problem is EXP-complete over this calculus and thus that exponential time is provably necessary in order to solve it. We then prove that, if we add a parallel composition operator to the calculus, and we impose that parallel composition is never used inside recursive definitions, then the bisimilarity problem is still EXP-complete, thus no harder than in the fragment without parallel composition.
This research was done while the first author was at the Istituto per l'Elaborazione dell'Informazione of the CNR (Italian Research Council). Work partially supported by EEC, within HCM Project Express, and by CNR, within the project “Specifica ad Alto Livello e Verifica di Sistemi Digitali”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Boreale and R. De Nicola. A symbolic semantics for the π-calculus. Short version in Proc. of CONCUR'94, LNCS, Springer Verlag. Full version to appear on Information and Computation.
M. Boreale and R. De Nicola. Testing equivalence for mobile processes. Information and Computation, 2(120):279–303, 1995.
M. Boreale and L. Trevisan. On the complexity of bisimilarity for value-passing processes. In Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science. LNCS, Springer Verlag, 1995.
D.P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993.
A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28(1): 114–133, 1981.
J. Hartmanis and R.E. Stearns. On the computational complexity of algorithms. Transactions of the AMS, 117:285–306, 1965.
M. Hennessy and A. Ingolfsdottir. A theory of communicating processes with value passing. Information and Computation, 2(107):202–236, 1993.
M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353–389, 1995.
B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite state programs. Information and Computation, 107:272–302, 1993.
P.C. Kanellakis and S.A. Smolka. CCS expressions, finite sate processes, and three problems of equivalence. Information and Computation, 86:43–68, 1990.
R. Milner. A Calculus of Communicating Systems. LNCS, 92. Springer-Verlag, Berlin, 1980.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part 1 and 2. Information and Computation, 100:1–78, 1992.
R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, 1987.
J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Information and Computation, 120(2):174–197, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boreale, M., Trevisan, L. (1996). Bisimilarity problems requiring exponential time (Extended abstract). In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_151
Download citation
DOI: https://doi.org/10.1007/3-540-61550-4_151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61550-7
Online ISBN: 978-3-540-70597-0
eBook Packages: Springer Book Archive