Strong bisimilarity on basic parallel processes in PSPACE-complete

Abstract

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 PSAPCE. Combining with the PSPACE-hardness result by Srba, PSPACE-completeness is thus established.