Strong bisimilarity on basic parallel processes is PSPACE-complete

被引：32
|
作者：
Jancar, P [1 ]
机构：
[1] Tech Univ Ostrava, Dept Comp Sci, CZ-70833 Ostrava, Czech Republic
来源：
18TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 2003年
关键词：
D O I：
10.1109/LICS.2003.1210061
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The paper shows an algorithm which, given a Basic-Parallel Processes (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence on the system. Though the number of the constructed mappings can be exponential, they can be generated in polynomial space; this shows that the problem of deciding bisimulation equivalence on BPP is in PSPACE. Combining with the PSPACE-hardness result by Srba, PSPACE-completeness is thus established.
引用
收藏
页码：218 / 227
页数：10
相关论文
共 50 条
  • [31] PROOF EQUIVALENCE IN MLL IS PSPACE-COMPLETE
    Heijltjes, Willem
    Houston, Robin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2016, 12 (01)
  • [32] Solving a PSPACE-complete problem with cP systems
    Henderson, Alec
    Nicolescu, Radu
    Dinneen, Michael J.
    JOURNAL OF MEMBRANE COMPUTING, 2020, 2 (04) : 311 - 322
  • [33] Solving a PSPACE-complete problem with cP systems
    Alec Henderson
    Radu Nicolescu
    Michael J. Dinneen
    Journal of Membrane Computing, 2020, 2 : 311 - 322
  • [34] Atropos: A PSPACE-Complete Sperner Triangle Game
    Burke, Kyle W.
    Teng, Shang-Hua
    INTERNET MATHEMATICS, 2008, 5 (04) : 477 - 492
  • [35] Deciding the K-dimension is PSPACE-complete
    Schaefer, M
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 198 - 203
  • [36] ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
    Steindl, Markus
    JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2019, 106 (01) : 127 - 142
  • [37] An Automaton Group with PSPACE-Complete Word Problem
    Jan Philipp Wächter
    Armin Weiß
    Theory of Computing Systems, 2023, 67 : 178 - 218
  • [38] FINITE-AUTOMATON APERIODICITY IS PSPACE-COMPLETE
    CHO, S
    HUYNH, DT
    THEORETICAL COMPUTER SCIENCE, 1991, 88 (01) : 99 - 116
  • [39] An Automaton Group with PSPACE-Complete Word Problem
    Waechter, Jan Philipp
    Weiss, Armin
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (01) : 178 - 218
  • [40] Solving a PSPACE-complete problem by gene assembly
    Zerjatke, Thomas
    Sturm, Monika
    JOURNAL OF LOGIC AND COMPUTATION, 2013, 23 (04) : 897 - 908
12345