Introduction to Probabilistic Concurrent Systems
From MaRDI portal
Publication:5044396
DOI10.3233/FI-222133OpenAlexW4286889156MaRDI QIDQ5044396FDOQ5044396
Authors: Samy Abbes 
Publication date: 31 October 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.00507
Cites Work
- Title not available (Why is that?)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Petri nets, event structures and domains. I
- Title not available (Why is that?)
- Foundations of Garside theory
- Combinatorics on traces
- Title not available (Why is that?)
- Combinatorial problems of commutation and rearrangements
- Clique polynomials have a unique root of smallest modulus
- Title not available (Why is that?)
- Computing the average parallelism in trace monoids.
- Uniform and Bernoulli measures on the boundary of trace monoids
- A spectral property for concurrent systems and some probabilistic applications
- Markovian dynamics of concurrent systems
Cited In (6)
- Title not available (Why is that?)
- Linear Structures for Concurrency in Probabilistic Programming Languages
- Confluence Reduction for Probabilistic Systems
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
- Convergence of distributions on paths
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)
