P-hardness of equivalence testing on finite-state processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2234, Issue , 2001, Pages 326-335

  Sawa, Zdenĕk ^a   Jančar, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

BISIMILARITY; BISIMULATION EQUIVALENCES; BOOLEAN CIRCUIT; EQUIVALENCE TESTING; FINITE STATE PROCESS; HARD PROBLEMS; LABELLED TRANSITION SYSTEMS; POLYNOMIAL-TIME;

EQUIVALENCE CLASSES;

EID: 84883369474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45627-9_29     Document Type: Conference Paper

References (9)

1. J. Balcazar, J. Gabarrò, and M. Sàntha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6A):638–648, 1992.
2. A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988.
3. 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.
4. P. Kanellakis and S. Smolka. CCS expressions, finite state processes and three problems of equivalence. Information and Computation, 86:43–68, 1990.
5. 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.
6. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
7. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16:937–989, 1987.
8. A. Rabinovich. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation, 139(2):111–129, 1997.
9. 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.