Refinement-oriented probability for CSP
From MaRDI portal
Publication:2365393
DOI10.1007/BF01213492zbMath0862.68050OpenAlexW2135795876MaRDI QIDQ2365393
Karen Seidel, Carroll Morgan, Annabelle McIver, Jeff W. Sanders
Publication date: 31 March 1997
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01213492
Related Items
Unifying Theories of Programming with Monads ⋮ A compositional modelling and verification framework for stochastic hybrid systems ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Algebraic theory of probabilistic and nondeterministic processes. ⋮ Reconciling real and stochastic time: the need for probabilistic refinement ⋮ Using schedulers to test probabilistic distributed systems ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Exploring probabilistic bisimulations. I ⋮ Stuttering for abstract probabilistic automata ⋮ Linking theories in probabilistic programming ⋮ Preservation of probabilistic information flow under refinement ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Preface ⋮ Semantic models for information flow ⋮ Remarks on Testing Probabilistic Processes ⋮ A process algebra for probabilistic and nondeterministic processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic communicating processes
- Bisimulation through probabilistic testing
- On sequential composition, action prefixes and process prefix
- Testing equivalences for processes
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Process Algebra
