Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999): Difference between revisions

@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760246
@@ Property / cites work: Q2760246 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence-checking on infinite-state systems: Techniques and results
+Normal rank
@@ Property / cites work @@
+Q4665738
@@ Property / cites work: Q4665738 / rank @@
+Normal rank
@@ Property / cites work @@
+On the regular structure of prefix rewriting
@@ Property / cites work: On the regular structure of prefix rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+CCS expressions, finite state processes, and three problems of equivalence
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760243
@@ Property / cites work: Q2760243 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of bisimulation equivalence for process generating context-free languages
+Normal rank
@@ Property / cites work @@
+Bisimulation equivalence is decidable for all context-free processes
+Normal rank
@@ Property / cites work @@
+An elementary bisimulation decision procedure for arbitrary context-free processes
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for deciding bisimilarity of normed context-free processes
+Normal rank
@@ Property / cites work @@
+Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
+Normal rank
@@ Property / cites work @@
+Strong bisimilarity of simple process algebras: Complexity lower bounds
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
+Normal rank
@@ Property / cites work @@
+The Bisimulation Problem for Equational Graphs of Finite Out-Degree
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? decidability results from complete formal systems
+Normal rank
@@ Property / cites work @@
+Decidability of DPDA equivalence
@@ Property / cites work: Decidability of DPDA equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of bisimulation equivalence for normed pushdown processes
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? A simplified decidability proof.
@@ Property / cites work: \(L(A)=L(B)\)? A simplified decidability proof. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737211
@@ Property / cites work: Q4737211 / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability of bisimilarity by defender's forcing
+Normal rank
@@ Property / cites work @@
+Q4938637
@@ Property / cites work: Q4938637 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing expressibility of normed BPA and normed BPP processes
+Normal rank
@@ Property / cites work @@
+Normed BPA vs. Normed BPP Revisited
@@ Property / cites work: Normed BPA vs. Normed BPP Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2003 - Concurrency Theory
@@ Property / cites work: CONCUR 2003 - Concurrency Theory / rank @@
+Normal rank