Pages that link to "Item:Q1417573"
From MaRDI portal
The following pages link to Computing the average parallelism in trace monoids. (Q1417573):
Displaying 14 items.
- Uniform and Bernoulli measures on the boundary of trace monoids (Q491977) (← links)
- Toward uniform random generation in 1-safe Petri nets (Q1687776) (← links)
- A cut-invariant law of large numbers for random heaps (Q1692253) (← links)
- Möbius inversion formula for the trace group (Q1764102) (← links)
- Synchronization of Bernoulli sequences on shared letters (Q2013553) (← links)
- A spectral property for concurrent systems and some probabilistic applications (Q2032884) (← links)
- Deterministic concurrent systems (Q2117189) (← links)
- Markovian dynamics of concurrent systems (Q2177775) (← links)
- Finite transducers for divisibility monoids (Q2508976) (← links)
- APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS (Q3538847) (← links)
- The conjugacy problem in subgroups of right-angled Artin groups (Q3644315) (← links)
- Introduction to Probabilistic Concurrent Systems (Q5044396) (← links)
- Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs (Q5275437) (← links)
- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (Q5428221) (← links)
