Introduction to Probabilistic Concurrent Systems
From MaRDI portal
Publication:5044396
Recommendations
Cites work
- scientific article; zbMATH DE number 4002104 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- A spectral property for concurrent systems and some probabilistic applications
- Clique polynomials have a unique root of smallest modulus
- Combinatorial problems of commutation and rearrangements
- Combinatorics on traces
- Computing the average parallelism in trace monoids.
- Foundations of Garside theory
- Markovian dynamics of concurrent systems
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Petri nets, event structures and domains. I
- Uniform and Bernoulli measures on the boundary of trace monoids
Cited in
(6)- Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
- scientific article; zbMATH DE number 7147446 (Why is no real title available?)
- Confluence Reduction for Probabilistic Systems
- Convergence of distributions on paths
- Linear Structures for Concurrency in Probabilistic Programming Languages
- Computing Behavioral Relations for Probabilistic Concurrent Systems
This page was built for publication: Introduction to Probabilistic Concurrent Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044396)
