Fairness of actions in system computations
- This paper contrasts two important features of parallel system computations: fairness and timing. The study is carried out at specification system level by resorting to a well-known process description language. The language is extended with labels which allow to filter out those process executions that are not (weakly) fair, and with upper time bounds for the process activities. We show that fairness and timing are closely related. Two main results are stated. First, we show that each everlasting (or non-Zeno) timed process execution is fair. Second, we provide a characterization for fair executions of untimed processes in terms of timed process executions. This results in a finite representation of fair executions using regular expressions.
| Author: | Flavio Corradini, Maria Rita di Berardini, Walter VoglerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-1303 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/179 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2005-02) |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2005 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/07 |
| GND-Keyword: | Fairness <Informatik> |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik / Professur für Theorie verteilter Systeme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
