AbstractExisting decision algorithms for bisimulation equivalence for normed context-free processes require at least exponential time. We develop a Σp2 (a subclass of PSPACE) algorithm for deciding bisimulation equivalence for normed context-free processes
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed context-free p...
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...
AbstractThe previous best upper bound on the complexity of deciding bisimilarity between normed cont...
AbstractWe show that the problem of deciding branching bisimulation equivalence for normed context-f...
AbstractWe show that the problem of deciding branching bisimulation equivalence for normed context-f...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
AbstractWe give NC1 reduction of bisimulation equivalence for (general) normed context-free processe...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
Abstract. We propose a decision procedure for a general class of normed commutative process rewrite ...
AbstractWe present a polynomial-time algorithm deciding bisimilarity between a normed BPA process an...
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed context-free p...
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...
AbstractThe previous best upper bound on the complexity of deciding bisimilarity between normed cont...
AbstractWe show that the problem of deciding branching bisimulation equivalence for normed context-f...
AbstractWe show that the problem of deciding branching bisimulation equivalence for normed context-f...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
AbstractWe give NC1 reduction of bisimulation equivalence for (general) normed context-free processe...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
Abstract. We propose a decision procedure for a general class of normed commutative process rewrite ...
AbstractWe present a polynomial-time algorithm deciding bisimilarity between a normed BPA process an...
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed context-free p...
DOI
Add to ORKG