Associativity for binary parallel processes: a quantitative study
From MaRDI portal
Recommendations
- A quantitative study of pure parallel processes
- The Combinatorics of Non-determinism
- Enumeration and random generation of concurrent computations
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
- Beyond series-parallel concurrent systems: the case of arch processes
Cited in
(5)- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
- Enumeration and random generation of concurrent computations
- Beyond series-parallel concurrent systems: the case of arch processes
- On some combinatorial properties of Linux process trees
- A quantitative study of pure parallel processes
This page was built for publication: Associativity for binary parallel processes: a quantitative study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174965)