High undecidability of weak bisimilarity for Petri nets (Q5096742): Difference between revisions

@@ Property / cites work @@
+Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
+Normal rank
@@ Property / cites work @@
+Bisimulation equivalence is decidable for all context-free processes
+Normal rank
@@ Property / cites work @@
+Q4525284
@@ Property / cites work: Q4525284 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for deciding bisimilarity of normed context-free processes
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
+Normal rank
@@ Property / cites work @@
+On the reachability problem for 5-dimensional vector addition systems
+Normal rank
@@ Property / cites work @@
+Q4490743
@@ Property / cites work: Q4490743 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942620
@@ Property / cites work: Q4942620 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4349577
@@ Property / cites work: Q4349577 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3911403
@@ Property / cites work: Q3911403 / rank @@
+Normal rank