Measure and probability for concurrency theorists
From MaRDI portal
Publication:1589655
DOI10.1016/S0304-3975(00)00096-7zbMath0956.68058MaRDI QIDQ1589655
Publication date: 12 December 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items (7)
When are stochastic transition systems tameable? ⋮ Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checking ⋮ Probabilistic Model Checking for Energy-Utility Analysis ⋮ Random Measurable Selections ⋮ Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness ⋮ A note on the attractor-property of infinite-state Markov chains ⋮ Verification of probabilistic systems with faulty communication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain theory and integration
- A probabilistic PDL
- CPO's of measures for nondeterminism
- Semantics of probabilistic programs
- Bisimulation through probabilistic testing
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems
- Truly concurrent constraint programming
- Nuclear and trace ideals in tensored \(^*\)-categories
- Dynamical systems, measures, and fractals via domain theory
- Bisimulation for labelled Markov processes
- Markov Chains
- Testing preorders for probabilistic processes
- A Compositional Approach to Performance Modelling
- Introdction to Measure and Probability
- Mathematical foundations of computer science 1978. Proceedings, 7th symposium Zakopane, Poland, September 4-8, 1978
This page was built for publication: Measure and probability for concurrency theorists