Toward uniform random generation in 1-safe Petri nets (Q1687776): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2619779746
@@ Property / OpenAlex ID: W2619779746 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05888
@@ Property / arXiv ID: 1706.05888 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform and Bernoulli measures on the boundary of trace monoids
+Normal rank
@@ Property / cites work @@
+Uniform Generation in Trace Monoids
@@ Property / cites work: Uniform Generation in Trace Monoids / rank @@
+Normal rank
@@ Property / cites work @@
+Q4304869
@@ Property / cites work: Q4304869 / rank @@
+Normal rank
@@ Property / cites work @@
+Diagnosis of asynchronous discrete-event systems: a net unfolding approach
+Normal rank
@@ Property / cites work @@
+Q3771633
@@ Property / cites work: Q3771633 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems of commutation and rearrangements
+Normal rank
@@ Property / cites work @@
+Note on the Smallest Root of the Independence Polynomial
+Normal rank
@@ Property / cites work @@
+Combinatorics on traces
@@ Property / cites work: Combinatorics on traces / rank @@
+Normal rank
@@ Property / cites work @@
+Clique polynomials have a unique root of smallest modulus
+Normal rank
@@ Property / cites work @@
+Computing the average parallelism in trace monoids.
+Normal rank
@@ Property / cites work @@
+Petri nets, event structures and domains. I
@@ Property / cites work: Petri nets, event structures and domains. I / rank @@
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+Q3754627
@@ Property / cites work: Q3754627 / rank @@
+Normal rank