A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Probabilistic non-determinism
Handbook of logic in computer science (vol. 3)
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Fundamenta Informaticae
Hi-index | 0.00 |
FS domains can be characterised using the upper or lower power domain construction. In these characterisations, separation by the elements of a finite set is replaced by separation by a continuous non-deterministic function with finite image. This notion of separation can be formalised in many different, but equivalent ways.