A recent paper by Jančar (presented at LiCS 2003) demonstrated that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. Here we explore a (more detailed) version of the respective algorithm when applied to the subclass called normed BPP (nBPP), and show that in this case the algorithm runs in polynomial time; (cs)
A recent paper by Jančar (presented at LiCS 2003) demonstrated that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space.
A recent paper by Jančar (presented at LiCS 2003) demonstrated that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. (en)