EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2009.04.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2029953169
@@ Property / OpenAlex ID: W2029953169 / rank @@
+Normal rank
@@ Property / cites work @@
+High undecidability of weak bisimilarity for Petri nets
+Normal rank
@@ Property / cites work @@
+Q2851063
@@ Property / cites work: Q2851063 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulation preorder over simple process algebras
@@ Property / cites work: Simulation preorder over simple process algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Q4484513
@@ Property / cites work: Q4484513 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508303
@@ Property / cites work: Q4508303 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on web services composition
@@ Property / cites work: A lower bound on web services composition / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of equivalence problems for concurrent systems of finite agents
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+CONCUR 2003 - Concurrency Theory
@@ Property / cites work: CONCUR 2003 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818858
@@ Property / cites work: Q4818858 / rank @@
+Normal rank
@@ Property / cites work @@
+Strong bisimilarity of simple process algebras: Complexity lower bounds
+Normal rank
@@ Property / cites work @@
+Q4484486
@@ Property / cites work: Q4484486 / rank @@
+Normal rank