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 条
  • [1] Bisimilarity of One-Counter Processes Is PSPACE-Complete
    Bohm, Stanislav
    Goller, Stefan
    Jancar, Petr
    CONCUR 2010 - CONCURRENCY THEORY, 2010, 6269 : 177 - +
  • [2] SNOWMAN is PSPACE-complete
    He, Weihua
    Liu, Ziwen
    Yang, Chao
    THEORETICAL COMPUTER SCIENCE, 2017, 677 : 31 - 40
  • [3] Lemmings is PSPACE-complete
    Viglietta, Giovanni
    THEORETICAL COMPUTER SCIENCE, 2015, 586 : 120 - 134
  • [4] Lemmings Is PSPACE-Complete
    Viglietta, Giovanni
    FUN WITH ALGORITHMS, 2014, 8496 : 340 - 351
  • [5] Bisimilarity on Basic Parallel Processes
    Jancar, Petr
    THEORETICAL COMPUTER SCIENCE, 2022, 903 : 26 - 38
  • [6] Bisimilarity on Basic Parallel Processes
    Jančar, Petr
    Theoretical Computer Science, 2022, 903 : 26 - 38
  • [7] Generalized Amazons is PSPACE-Complete
    Furtak, Timothy
    Kiyomi, Masashi
    Uno, Takeaki
    Buro, Michael
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 132 - 137
  • [8] Robustness of PSPACE-complete sets
    Pavan, A.
    Wang, Fengming
    INFORMATION PROCESSING LETTERS, 2007, 103 (03) : 102 - 104
  • [9] Strong bisimilarity and regularity of basic process algebra is PSPACE-hard
    Srba, J
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 716 - 727
  • [10] Havannah and TwixT are PSPACE-complete
    Bonnet, Edouard
    Jamain, Florian
    Saffidine, Abdallah
    COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 175 - 186
12345