Bisimulation equivalence is decidable for one-counter processes (Q4571985): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63165-8_210
+Normal rank
@@ Property / OpenAlex ID @@
+W1525520647
@@ Property / OpenAlex ID: W1525520647 / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation collapse and the process taxonomy
@@ Property / cites work: Bisimulation collapse and the process taxonomy / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation equivalence is decidable for all context-free processes
+Normal rank
@@ Property / cites work @@
+Petri nets, commutative context-free grammars, and basic parallel processes
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4525284
@@ Property / cites work: Q4525284 / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability of bisimilarity for Petri nets and some related problems
+Normal rank
@@ Property / cites work @@
+Q4818859
@@ Property / cites work: Q4818859 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of bisimulation equivalence for normed pushdown processes
+Normal rank