Countable nondeterminism and random assignment
Journal of the ACM (JACM)
A theory for nondeterminism, parallelism, communication, and concurrency
Theoretical Computer Science
Parallel program design: a foundation
Parallel program design: a foundation
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate calculus and program semantics
Predicate calculus and program semantics
A Weaker Precondition for Loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Theoretical Computer Science
Action Systems with Continuous Behaviour
Hybrid Systems V
An Algebraic Approach to Refinement with Fair Choice
Electronic Notes in Theoretical Computer Science (ENTCS)
On two dually nondeterministic refinement algebras
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
A fixpoint semantics of event systems with and without fairness assumptions
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
The paper studies the incorporation of a fair nondeterministic choice operator into a generalization of Dijkstra's calculus of guarded commands. The generalization drops the law of the excluded miracle to allow commands that correspond to partial relations. Because of fairness, the new operator is not monotonic for the orderings that are generally used for proving the existence of least fixed points for recursive definitions. To prove the existence of fixed points it is necessary to consider several orderings at once, and to restrict the class of recursive definitions.