Concurrency, σ-Algebras, and Probabilistic Fairness
From MaRDI portal
Publication:3617742
DOI10.1007/978-3-642-00596-1_27zbMath1234.68279OpenAlexW1541860998MaRDI QIDQ3617742
Publication date: 31 March 2009
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_27
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism, Branching cells for asymmetric event structures, A Theory of Distributed Markov Chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulation through probabilistic testing
- Fairness, distances and degrees
- Approximating labelled Markov processes
- True-concurrency probabilistic models: Markov nets and a law of large numbers
- True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
- Probabilistic event structures and domains
- A Compositional Approach to Performance Modelling
- Foundations of Software Science and Computational Structures
- Applications and Theory of Petri Nets 2005
- A projective formalism applied to topological and probabilistic event structures