AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems and several classes of infinite-state systems: context-free processes and normed basic parallel processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity problems involving infinite-state systems
We design a general method for proving decidability of bisimulation-like equivalences between infini...
AbstractWeak bisimilarity is one of the most studied behavioural equivalences. This equivalence is u...
AbstractWe do not know whether weak bisimilarity (denoted ≈) is decidable for general BPA and BPP bu...
AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems...
AbstractIn this paper we use the tableau as a means to prove decidability of weak bisimulation for n...
AbstractIt is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA)...
AbstractIt is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA)...
Abstract. We consider the problem of deciding regularity of normed BPP and normed BPA processes. A p...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
AbstractIn this paper we consider the problem of deciding bisimulation equivalence of a BPP and a fi...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Bas...
AbstractWe show that checking weak bisimulation equivalence of two context-free processes (also call...
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidab...
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a norm...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
AbstractWeak bisimilarity is one of the most studied behavioural equivalences. This equivalence is u...
AbstractWe do not know whether weak bisimilarity (denoted ≈) is decidable for general BPA and BPP bu...
AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems...
AbstractIn this paper we use the tableau as a means to prove decidability of weak bisimulation for n...
AbstractIt is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA)...
AbstractIt is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA)...
Abstract. We consider the problem of deciding regularity of normed BPP and normed BPA processes. A p...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
AbstractIn this paper we consider the problem of deciding bisimulation equivalence of a BPP and a fi...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Bas...
AbstractWe show that checking weak bisimulation equivalence of two context-free processes (also call...
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidab...
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a norm...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
AbstractWeak bisimilarity is one of the most studied behavioural equivalences. This equivalence is u...
AbstractWe do not know whether weak bisimilarity (denoted ≈) is decidable for general BPA and BPP bu...
DOI
Add to ORKG