Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-23217-6_35
+Normal rank
@@ Property / OpenAlex ID @@
+W23983374
@@ Property / OpenAlex ID: W23983374 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4353915
@@ Property / cites work: Q4353915 / rank @@
+Normal rank
@@ Property / cites work @@
+Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
+Normal rank
@@ Property / cites work @@
+Decidability of performance equivalence for basic parallel processes
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736869
@@ Property / cites work: Q4736869 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4665738
@@ Property / cites work: Q4665738 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218096
@@ Property / cites work: Q4218096 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2769443
@@ Property / cites work: Q2769443 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3090854