Refinement-oriented probability for CSP

DOI10.1007/BF01213492zbMath0862.68050MaRDI QIDQ2365393

Karen Seidel, Annabelle McIver, Jeff W. Sanders, Carroll Morgan

Publication date: 31 March 1997

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

probability; CSP; refinement; concurrency; nondeterminism

Mathematics Subject Classification ID

68N15: Theory of programming languages

Related Items

Preface, 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., A process algebra for probabilistic and nondeterministic processes, Semantic models for information flow, 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, Linking theories in probabilistic programming, Stuttering for abstract probabilistic automata, Preservation of probabilistic information flow under refinement, Remarks on Testing Probabilistic Processes, On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item