Multirelations with infinite computations
We describe operations and properties of multirelations in terms of relations. We extend multirelations to represent finite and infinite computations independently. We characterise multirelations that model strict computations. We use RelView to derive an approximation order for multirelations. The approximation order uses only weak assumptions in pointed distributive lattices.
multirelations relations relview approximation order median program semantics sequential computations