Abstract
Dijkstra's language of guarded commands is extended by parallel compounds and conditional critical regions to a concurrent programming language. Based on the calculus of weakest preconditions the mathematical semantics of the extended language is specified by axiomatic transformation rules. A semantic model is given which is proved to be fully abstract for the nondeterministic sequential language as well as for the extended language for concurrent programming. Then an ″operational semantics″ for the language is described in the form of traces. In this formal framework fairness properties of concurrent programs are defined. The incompatibility of fairness assumptions with the notions of continuity, computability, and abstractness is discussed.
| Original language | English |
|---|---|
| Pages | 116-125 |
| Number of pages | 10 |
| State | Published - 1981 |
| Event | Proc - Int Conf on Distrib Comput Syst, 2nd - Paris, Fr Duration: 8 Apr 1981 → 10 Apr 1981 |
Conference
| Conference | Proc - Int Conf on Distrib Comput Syst, 2nd |
|---|---|
| City | Paris, Fr |
| Period | 8/04/81 → 10/04/81 |