AbstractWe describe a general method for deciding bisimilarity for pairs of processes where one process has finitely many states. We apply this method to pushdown processes and to PA processes. We also demonstrate that the mentioned problem is undecidable for ‘state-extended' PA processes
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
AbstractIn this paper we consider the problem of deciding bisimulation equivalence of a BPP and a fi...
AbstractWe establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking fo...
AbstractWe describe a general method for deciding bisimilarity for pairs of processes where one proc...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
AbstractWe show that characteristic formulae for finite-state systems up to bisimulation-like equiva...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems...
Stirling (1996, 1998) proved the decidability of bisimilarity on so called normed pushdown processes...
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterminis...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine s...
We establish 11-completeness (in the analytical hierarchy) of weak bisimilarity checking for innite-...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
AbstractIn this paper we consider the problem of deciding bisimulation equivalence of a BPP and a fi...
AbstractWe establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking fo...
AbstractWe describe a general method for deciding bisimilarity for pairs of processes where one proc...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
AbstractWe show that characteristic formulae for finite-state systems up to bisimulation-like equiva...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
AbstractWe prove that weak bisimilarity is decidable in polynomial time between finite-state systems...
Stirling (1996, 1998) proved the decidability of bisimilarity on so called normed pushdown processes...
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterminis...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine s...
We establish 11-completeness (in the analytical hierarchy) of weak bisimilarity checking for innite-...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
AbstractIn this paper we consider the problem of deciding bisimulation equivalence of a BPP and a fi...
AbstractWe establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking fo...
DOI
Add to ORKG