Results 11 
14 of
14
Weak Bisimilarity between FiniteState Systems and BPA or Normed BPP is Decidable in Polynomial Time
 Theoretical Computer Science
, 2000
"... We prove that weak bisimilarity is decidable in polynomial time between finitestate systems and several classes of infinitestate systems: contextfree processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove that weak bisimilarity is decidable in polynomial time between finitestate systems and several classes of infinitestate systems: contextfree processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity problems involving infinitestate systems.
The Complexity of BisimilarityChecking for OneCounter Processes
"... We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finitestat ..."
Abstract
 Add to MetaCart
We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finitestate processes is DPhard. In particular, this means that the problem is both NP and coNP hard. The same technique is used to demonstrate coNPhardness of strong bisimilarity between processes of onecounter nets. Then we design an algorithm which decides weak bisimilarity between processes of onecounter automata and finitestate processes in time which is polynomial for a large subclass of instances, giving a kind of characterization of all hard instances as a byproduct. Moreover, we show how to efficiently estimate the time which is needed to solve a given instance. Finally, we prove that the problem of strong bisimilarity between processes of onecounter automata and finitestate processes is in P.
DOI: 10.1145/2429069.2429124 Checking NFA equivalence with bisimulations up to congruence
, 2012
"... We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp [16]. We compare our approach to the recently introduced antichain alg ..."
Abstract
 Add to MetaCart
We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp [16]. We compare our approach to the recently introduced antichain algorithms, by analysing and relating the two underlying coinductive proof methods. We give concrete examples where we exponentially improve over antichains; experimental results moreover show non negligible improvements.