Concurrency and probability: removing confusion, compositionally
DOI10.1145/3209108.3209202zbMATH Open1497.68329OpenAlexW2963312557MaRDI QIDQ5145292FDOQ5145292
Authors: Roberto Bruni, Hernan Melgratti, Ugo Montanari
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3209108.3209202
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (7)
- Bayesian strategies: probabilistic programs as generalised graphical models
- Title not available (Why is that?)
- Bayesian network semantics for Petri nets
- Confluence Reduction for Probabilistic Systems
- Foundations of Software Science and Computational Structures
- Title not available (Why is that?)
- Confusion-tolerant computation of probability in acyclic nets
This page was built for publication: Concurrency and probability: removing confusion, compositionally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145292)