Bisimilarity on normed Basic Parallel Processes can be decided in time O ( n 3 )
نویسندگان
چکیده
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; we provide a complexity analysis yielding the upper bound O(n3). This strenghtens a result by Hirshfeld, Jerrum and Moller (1996) who showed a different polynomial-time algorithm for nBPP; they did not analyse the complexity of their algorithm more precisely but it does not seem to allow the above mentioned upper bound.
منابع مشابه
Complexity of deciding bisimilarity of nBPP and bisimilarity of BPP with finite-state system
Jančar has recently shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space (presented at LiCS 2003). In this paper are summarized two results which use general techniques from Jančar’s paper. First result by Kot and Jančar (presented at AVIS 2004) shows that bisimilarity on normed basic parallel processes can be decided in O(n). The second result by Kot and...
متن کاملComputational Complexity of Some Equivalence-Checking Problems
This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems and related areas. The first of these papers, Sawa, Jančar: Equivalences on Finite-State Systems are PTIME-hard (2005), shows that deciding any relation between bisimulation equivalence (bisimilarity) and tr...
متن کاملNormed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
We propose a decision procedure for a general class of normed commutative process rewrite systems and their induced bisimulation equivalences. Our technique is inspired by the polynomial-time algorithm for strong bisimilarity on normed Basic Parallel Processes (BPP), developed by Hirshfeld, Jerrum and Moller. As part of our framework we present a generic unique decomposition result, which we ob...
متن کاملINFINITY 2008 Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
We propose a decision procedure for a general class of normed commutative process rewrite systems and their induced bisimulation equivalences. Our technique is inspired by the polynomial-time algorithm for strong bisimilarity on normed Basic Parallel Processes (BPP), developed by Hirshfeld, Jerrum and Moller. As part of our framework we present a generic unique decomposition result, which we ob...
متن کاملWeak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
We prove that weak bisimilarity is decidable in polynomial time between nite-state systems and several classes of innnite-state systems: context-free processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the rst polynomial algorithms for weak bisimilarity problems involving innnite-state systems.
متن کامل