Abstract
The paper shows a simple LOGSPACE-reduction from the boolean circuit value problem which demonstrates that, on finite labelled transition systems, deciding an arbitrary relation which subsumes bisimulation equivalence and is subsumed by trace preorder is a polynomialtime- hard problem (and thus can not be expected to be efficiently parallelizable). By this, the result of Balcázar, Gabarró and Sántha (1992) for bisimilarity is substantially extended.
Supported by the Grant Agency of the Czech Republic, Grant No. 201/00/0400
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Balcázar, J. Gabarró, and M. Sántha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6A):638–648, 1992.
A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988.
H. Hüttel and S. Shukla. On the complexity of deciding behavioural equivalences and preorders. Technical Report SUNYA-CS-96-03, State University of New York at Albany, Dec. 28, 1996. Also available at http://www.cs.auc.dk/~hans/Publications/pubs.html.
P. Kanellakis and S. Smolka. CCS expressions, finite state processes and three problems of equivalence. Information and Computation, 86:43–68, 1990.
F. Laroussinie and P. Schnoebelen. The state explosion problem from trace to bisimulation equivalence. In Proc. FoSSaCS 2000, volume 1784 of Lecture Notes in Computer Science, pages 192–207. Springer Verlag, 2000.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16:937–989, 1987.
A. Rabinovich. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation, 139(2):111–129, 1997.
R. van Glabbeek. The linear time — branching time spectrum. In Proceedings CONCUR’90, volume 458 of Lecture Notes in Computer Science, pages 278–297, Amsterdam, 1990. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sawa, Z., Jančar, P. (2001). P-Hardness of Equivalence Testing on Finite-State Processes. In: Pacholski, L., Ružička, P. (eds) SOFSEM 2001: Theory and Practice of Informatics. SOFSEM 2001. Lecture Notes in Computer Science, vol 2234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45627-9_29
Download citation
DOI: https://doi.org/10.1007/3-540-45627-9_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42912-8
Online ISBN: 978-3-540-45627-8
eBook Packages: Springer Book Archive