Pages that link to "Item:Q2365393"

The following pages link to Refinement-oriented probability for CSP (Q2365393):

Displaying 17 items.

• Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• Algebraic theory of probabilistic and nondeterministic processes. (Q1400156) (← links)
• A process algebra for probabilistic and nondeterministic processes (Q1607111) (← links)
• Semantic models for information flow (Q1826632) (← links)
• Reconciling real and stochastic time: the need for probabilistic refinement (Q1941867) (← links)
• Using schedulers to test probabilistic distributed systems (Q1941881) (← links)
• Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
• Exploring probabilistic bisimulations. I (Q1941884) (← links)
• Linking theories in probabilistic programming (Q1961866) (← links)
• A compositional modelling and verification framework for stochastic hybrid systems (Q2403530) (← links)
• Stuttering for abstract probabilistic automata (Q2436515) (← links)
• Preservation of probabilistic information flow under refinement (Q2482443) (← links)
• Remarks on Testing Probabilistic Processes (Q2864156) (← links)
• Unifying Theories of Programming with Monads (Q3455643) (← links)
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
• Preface (Q5970649) (← links)