Refinement-oriented probability for CSP
From MaRDI portal
Publication:2365393
Recommendations
- Theory and Applications of Satisfiability Testing
- Extended Formulation Lower Bounds for Refuting Random CSPs
- Probabilistic analysis of satisfiability algorithms
- Probabilistic approach to the satisfiability problem
- Hierarchical reasoning in probabilistic CSP
- Probabilistic satisfiability
- Probabilistic satisfiability
- Extending hybrid CSP with probability and stochasticity
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- A probabilistic study on the satisfiability problem
Cites work
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Bisimulation through probabilistic testing
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3846844 (Why is no real title available?)
- scientific article; zbMATH DE number 3919813 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 710624 (Why is no real title available?)
- scientific article; zbMATH DE number 795688 (Why is no real title available?)
- On sequential composition, action prefixes and process prefix
- Probabilistic communicating processes
- Process Algebra
- Reactive, generative, and stratified models of probabilistic processes
- Testing equivalences for processes
Cited in
(30)- Probabilistic models for the guarded command language
- 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
- A compositional modelling and verification framework for stochastic hybrid systems
- Stuttering for abstract probabilistic automata
- Preservation of probabilistic information flow under refinement
- On the expressive power of CSP refinement
- From distributions to probabilistic reactive programs
- Remarks on testing probabilistic processes
- Unifying theories of programming with monads
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Testing probabilistic equivalence through reinforcement learning
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 1324656 (Why is no real title available?)
- ZB 2005: Formal Specification and Development in Z and B
- Communicating Sequential Processes. The First 25 Years
- A model of probabilistic processes
- Hierarchical reasoning in probabilistic CSP
- Preface
- A Coq implementation of the program algebra in Jifeng He's new roadmap for linking theories of programming
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
- Infinite choice and probability distributions. An open problem: the real hotel
- Probabilistic communicating processes
- Denotational semantics for probabilistic and concurrent programs
This page was built for publication: Refinement-oriented probability for CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365393)
