Deciding bisimilarity is P -complete-Reference-Cited by-同舟云学术

Deciding bisimilarity is P -complete

Published:1992-11 Issue:Suppl 1 Volume:4 Page:638-648
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Balcázar José¹,Gabarró Joaquim¹,Sántha Miklós²

Affiliation:

1. Dep. de Llenguatges i Sistemes Informátics, Universitat Politécnica de Catalunya, Pau Gargallo 5, 08028, Barcelona, Spain

2. CNRS, URA 410, Université Paris-Sud, LRI, Orsay, France

Abstract

Abstract In finite labelled transition systems the problems of deciding strong bisimilarity, observation equivalence and observation congruence are P -complete under many—one NC -reducibility. As a consequence, algorithms for automated analysis of finite state systems based on bisimulation seem to be inherently sequential in the following sense: the design of an NC algorithm to solve any of these problems will require an algorithmic breakthrough, which is exceedingly hard to achieve.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF03180566.pdf

Reference20 articles.

1. [AHU75] Aho A. Hopcroft J. and Ullman J.: The Design and Analysis of Computer Algorithms . Addison-Wesley 1975.

2. P-uniform circuit complexity

3. [ABG91] Álvarez c. Balcázar J.L. Gabarró J. and Sántha M.: Parallel Complexity in the Design and Analysis of Concurrent Systems. In: Paral1el Architectures and Languages Europe PARLE’91 Lecture Notes in Computer Science 505 Springer-Verlag pp. 288–303 1991.

4. [BDG88] Balcázar J.L. Díaz J. and Gabarró J.: Structural Complexity I . Springer-Verlag 1988.

5. [BDG90] Balcázar J.L. Díaz J. and Gabarró J.: Structural Complexity II . Springer-Verlag 1990.

Cited by 62 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bisimulation in model-changing modal logics: An algorithmic study;Journal of Logic and Computation;2023-08-24

2. Linear parallel algorithms to compute strong and branching bisimilarity;Software and Systems Modeling;2022-12-06

3. Bisimilarity on Basic Parallel Processes;Theoretical Computer Science;2022-02

4. Distributed Coalgebraic Partition Refinement;Tools and Algorithms for the Construction and Analysis of Systems;2022

5. The parametric complexity of bisimulation equivalence of normed pushdown automata;Frontiers of Computer Science;2021-12-03