Name
Abstract | ||
|---|---|---|
In this paper we are concerned with an operational approach to fairness, the problem of defining and generating the fair execution sequences of a concurrent language. One solution invokes two semantic levels: one level (the positive) prescribes the finite and infinite execution sequences without regard to their fairness while the other (the negative) filters out the unfair ones. The first level is given as a set of generative rules whereas the second is encoded as a definition of fair execution sequence. Entirely positive approaches have been proposed which appeal to random assignment. Here we offer an alternative positive approach for a subset of Milner's CCS. We show that rules can be given for generating just the fair sequences which avoid random assignment. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1007/BF00271640 | fundamentals of computation theory |
Keywords | Field | DocType |
Information System,Operating System,Data Structure,Communication Network,Information Theory | Information system,Information theory,Data structure,Discrete mathematics,Computer science,Communicating sequential processes,Random assignment,Calculus of communicating systems,Generative grammar,Process calculus | Conference |
Volume | Issue | ISSN |
21 | 5 | 0001-5903 |
ISBN | Citations | PageRank |
3-540-12689-9 | 25 | 10.14 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gerardo Costa | 1 | 118 | 24.34 |
| Colin Stirling | 2 | 934 | 102.50 |