Pages that link to "Item:Q3184679"

The following pages link to Testing Finitary Probabilistic Processes (Q3184679):

Displaying 25 items.

• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• The infinite evolution mechanism of \(\epsilon\)-bisimilarity (Q458130) (← links)
• Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours (Q1633345) (← links)
• Quantitative analysis of software approximate correctness (Q1664851) (← links)
• Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
• Probabilistic bisimilarity as testing equivalence (Q1680507) (← links)
• Using schedulers to test probabilistic distributed systems (Q1941881) (← links)
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
• Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
• Exploring probabilistic bisimulations. I (Q1941884) (← links)
• On the probabilistic bisimulation spectrum with silent moves (Q2182668) (← links)
• Stuttering for abstract probabilistic automata (Q2436515) (← links)
• Real-reward testing for probabilistic processes (Q2453107) (← links)
• Probabilistic model of software approximate correctness (Q2825263) (← links)
• On the Semantics of Markov Automata (Q3012929) (← links)
• Testing Finitary Probabilistic Processes (Q3184679) (← links)
• Termination in Convex Sets of Distributions (Q4558786) (← links)
• (Q5009413) (← links)
• Probabilistic Analysis of Binary Sessions (Q5089279) (← links)
• (Q5094151) (← links)
• (Q5111636) (← links)
• (Q5155671) (← links)
• Probabilistic Bisimulation for Realistic Schedulers (Q5206954) (← links)
• A Semantics for Every GSPN (Q5300867) (← links)
• On divergence-sensitive weak probabilistic bisimilarity (Q6040671) (← links)