Add to ORKGA polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commitative parallel-composition operator
AbstractWe give NC1 reduction of bisimulation equivalence for (general) normed context-free processe...
. Recent results show that strong bisimilarity is decidable for the class of Basic Parallel Processe...
AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems...
A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Pa...
Abstract. We propose a decision procedure for a general class of normed commutative process rewrite ...
AbstractWe propose a decision procedure for a general class of normed commutative process rewrite sy...
AbstractWe show polynomial time algorithms for deciding hereditary history preserving bisimilarity (...
AbstractExisting decision algorithms for bisimulation equivalence for normed context-free processes ...
AbstractThe previous best upper bound on the complexity of deciding bisimilarity between normed cont...
A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally norm...
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has...
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a norm...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Bas...
We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n3 ...
AbstractWe give NC1 reduction of bisimulation equivalence for (general) normed context-free processe...
. Recent results show that strong bisimilarity is decidable for the class of Basic Parallel Processe...
AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems...
A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Pa...
Abstract. We propose a decision procedure for a general class of normed commutative process rewrite ...
AbstractWe propose a decision procedure for a general class of normed commutative process rewrite sy...
AbstractWe show polynomial time algorithms for deciding hereditary history preserving bisimilarity (...
AbstractExisting decision algorithms for bisimulation equivalence for normed context-free processes ...
AbstractThe previous best upper bound on the complexity of deciding bisimilarity between normed cont...
A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally norm...
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has...
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a norm...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Bas...
We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n3 ...
AbstractWe give NC1 reduction of bisimulation equivalence for (general) normed context-free processe...
. Recent results show that strong bisimilarity is decidable for the class of Basic Parallel Processe...
AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems...