On the complexity of the linear-time μ-calculus for Petri Nets (Q6487371): Difference between revisions

@@ Property / cites work @@
+Verifying programs with unreliable channels
@@ Property / cites work: Verifying programs with unreliable channels / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Positive Integral Solutions of Linear Diophantine Equations
+Normal rank
@@ Property / cites work @@
+Q4256653
@@ Property / cites work: Q4256653 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954445
@@ Property / cites work: Q4954445 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4790409
@@ Property / cites work: Q4790409 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite results
@@ Property / cites work: Infinite results / rank @@
+Normal rank
@@ Property / cites work @@
+Q3907077
@@ Property / cites work: Q3907077 / rank @@
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+A multiparameter analysis of the boundedness problem for vector addition systems
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Reasoning about infinite computations
@@ Property / cites work: Reasoning about infinite computations / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal logic can be more expressive
@@ Property / cites work: Temporal logic can be more expressive / rank @@
+Normal rank