Hardness of equivalence checking for composed finite-state systems (Q1015390): Difference between revisions

@@ Property / DOI @@
-.1007/s00236-008-0088-x
@@ Property / DOI: 10.1007/s00236-008-0088-x / rank @@
-Normal rank
@@ Property / cites work @@
+Deciding bisimilarity is P-complete
@@ Property / cites work: Deciding bisimilarity is P-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Q2760238
@@ Property / cites work: Q2760238 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3777424
@@ Property / cites work: Q3777424 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247261
@@ Property / cites work: Q4247261 / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability of bisimilarity by defender's forcing
+Normal rank
@@ Property / cites work @@
+CCS expressions, finite state processes, and three problems of equivalence
+Normal rank
@@ Property / cites work @@
+Q4508303
@@ Property / cites work: Q4508303 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of a merge recognition problem
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Three Partition Refinement Algorithms
@@ Property / cites work: Three Partition Refinement Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of equivalence problems for concurrent systems of finite agents
+Normal rank
@@ Property / cites work @@
+CONCUR 2003 - Concurrency Theory
@@ Property / cites work: CONCUR 2003 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424633
@@ Property / cites work: Q3424633 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818858
@@ Property / cites work: Q4818858 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4484486
@@ Property / cites work: Q4484486 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of iterated shuffle
@@ Property / cites work: On the complexity of iterated shuffle / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00236-008-0088-X
@@ Property / DOI: 10.1007/S00236-008-0088-X / rank @@
+Normal rank