Toward uniform random generation in 1-safe Petri nets
From MaRDI portal
Publication:1687776
DOI10.1016/j.endm.2017.05.002zbMath1423.68303arXiv1706.05888OpenAlexW2619779746MaRDI QIDQ1687776
Publication date: 4 January 2018
Full work available at URL: https://arxiv.org/abs/1706.05888
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work
- Clique polynomials have a unique root of smallest modulus
- Uniform and Bernoulli measures on the boundary of trace monoids
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Petri nets, event structures and domains. I
- Combinatorics on traces
- Computing the average parallelism in trace monoids.
- Combinatorial problems of commutation and rearrangements
- Uniform Generation in Trace Monoids
- Note on the Smallest Root of the Independence Polynomial
- Diagnosis of asynchronous discrete-event systems: a net unfolding approach
- Unnamed Item
- Unnamed Item
- Unnamed Item