An adequacy theorem between mixed powerdomains and probabilistic concurrency
<|reference_start|>An adequacy theorem between mixed powerdomains and probabilistic concurrency: We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains which combine non-determinism with stochasticity. The theorem itself is formulated via M. Smyth's idea of treating observable properties as open sets of a topological space.   One application of our theorem is that it entails semi-decidability w.r.t. whether a concurrent program satisfies an observable property (written in a certain form). This is intimately connected to M. Escard\'o's conjecture about semi-decidability w.r.t. may and must probabilistic testing.<|reference_end|>
@article{neves2024an,
    title={An adequacy theorem between mixed powerdomains and probabilistic
  concurrency},
    author={Renato Neves},
    journal={arXiv preprint arXiv:2409.15920},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.15920},
    primaryClass={cs.LO}
}